805 search results - page 90 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
158
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
164
click to vote
ICDT
2001
ACM
15 years 10 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
269
click to vote
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
168
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This is the first part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading, under the general assumption that the jammer has no...
163
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...