2899 search results - page 124 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
151
Voted
PPDP
2010
Springer
14 years 12 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
112
click to vote
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
119
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
122
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
124
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Selecting the most relevant factors from genetic profiles that can optimally characterize cellular states is of crucial importance in identifying complex disease genes and biomark...