Sciweavers

8025 search results - page 352 / 1605
» Combinators Introduction: An Algorithm
Sort
View
STOC
2004
ACM
109views Algorithms» more  STOC 2004»
16 years 7 months ago
Approximating the cut-norm via Grothendieck's inequality
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
Noga Alon, Assaf Naor
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
16 years 4 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
SPIN
2009
Springer
16 years 1 months ago
Improving Non-Progress Cycle Checks
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
David Faragó, Peter H. Schmitt
CEC
2008
IEEE
16 years 1 months ago
Differential evolution for discrete optimization: An experimental study on Combinatorial Auction problems
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
Jingqiao Zhang, Viswanath Avasarala, Arthur C. San...
AIME
2007
Springer
16 years 1 months ago
Enhancing Automated Test Selection in Probabilistic Networks
Abstract. Most test-selection algorithms currently in use with probabilistic networks select variables myopically, that is, test variables are selected sequentially, on a one-by-on...
Danielle Sent, Linda C. van der Gaag