706 search results - page 121 / 142 » Super Solutions in Constraint Programming |
101
click to vote
LATIN
2010
Springer
14 years 10 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
SENSYS
2009
ACM
15 years 6 months ago
2009
ACM
The programming and retasking of sensor nodes could benefit greatly from the use of a virtual machine (VM) since byte code is compact, can be loaded on demand, and interpreted on...
MOBIHOC
2006
ACM
15 years 11 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
127
click to vote
HPDC
2003
IEEE
15 years 5 months ago
2003
IEEE
Increasingly, scalable distributed applications are being constructed by integrating reusable components spanning multiple administrative domains. Dynamic composition and deployme...
100
click to vote
NIPS
1996
15 years 1 months ago
1996
In cellular telephone systems, an important problem is to dynamically allocate the communication resource channels so as to maximize service in a stochastic caller environment. Th...