1705 search results - page 303 / 341 » Representing Constraints with Automata |
116
click to vote
MOBICOM
2006
ACM
15 years 3 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
SIGIR
2006
ACM
15 years 3 months ago
2006
ACM
A common limitation of many retrieval models, including the recently proposed axiomatic approaches, is that retrieval scores are solely based on exact (i.e., syntactic) matching o...
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
Decision-support requires the gathering and presentation of information, but is subject to many kinds of resource restrictions (e.g. cost, length, time). Individual users differ n...
SAT
2005
Springer
15 years 3 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...