518 search results - page 77 / 104 » Beating a Random Assignment |
121
Voted
AI
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
133
Voted
CP
1997
Springer
15 years 6 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
151
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper concerns the cross-layer design between physical layer and MAC (Multiple Access Control) layer in asynchronous wireless random access network. The proposed cross-layer d...
125
click to vote
BROADNETS
2004
IEEE
15 years 6 months ago
2004
IEEE
Multi-homed, mobile wireless computing and communication devices can spontaneously form communities to logically combine and share the bandwidth of each other's wide-area com...
114
click to vote
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...