501 search results - page 58 / 101 » Scheduling Abstractions for Local Search |
INFOCOM
2000
IEEE
14 years 27 days ago
2000
IEEE
Abstract— Alternate path routing has been well-explored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, asi...
ARCS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Many-core processor architectures require scalable solutions that reflect the locality and power constraints of future generations of technology. This paper presents a CM...
AMC
2008
13 years 8 months ago
2008
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
ADHOCNOW
2009
Springer
14 years 3 months ago
2009
Springer
Abstract— Mobile wireless sensor networks have to be robust against the limitations of the underlying platform. While lightweight form factor makes them an attractive choice for ...