4860 search results - page 314 / 972 » SNPs Problems, Complexity, and Algorithms |
FSTTCS
2007
Springer
15 years 7 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
126
Voted
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
100
Voted
VTC
2006
IEEE
15 years 6 months ago
2006
IEEE
— In this paper, we investigate the adaptive resource allocation problem in multiuser multihop OFDM systems. Assuming that base station(BS) knows all channel information, we form...
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
125
click to vote
CONSTRAINTS
2006
15 years 25 days ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...