16188 search results - page 2582 / 3238 » The Optimal PAC Algorithm |
184
click to vote
ICALP
2004
Springer
16 years 18 days ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
199
click to vote
IWQOS
2004
Springer
16 years 17 days ago
2004
Springer
— We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes...
213
click to vote
PRICAI
2004
Springer
16 years 17 days ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
221
click to vote
WEA
2004
Springer
16 years 17 days ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
210
click to vote
INFOCOM
2003
IEEE
16 years 15 days ago
2003
IEEE
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...