893 search results - page 151 / 179 » P3C: A New Algorithm for the Simple Temporal Problem |
DSOM
2003
Springer
14 years 2 months ago
2003
Springer
One of the main problems with today's Internet traffic analysis is caused by the large number of network-based applications whose types and traffic patterns are more complicat...
COCO
2007
Springer
14 years 24 days ago
2007
Springer
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
ESA
2006
Springer
14 years 16 days ago
2006
Springer
Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or...
NIPS
2008
13 years 10 months ago
2008
We provide a new analysis of an efficient margin-based algorithm for selective sampling in classification problems. Using the so-called Tsybakov low noise condition to parametrize...
NIPS
1994
13 years 10 months ago
1994
It is widely accepted that the use of more compact representations than lookup tables is crucial to scaling reinforcement learning (RL) algorithms to real-world problems. Unfortun...