Sciweavers

12950 search results - page 2553 / 2590
» On Optimal Timed Strategies
Sort
View
ICONIP
2007
13 years 9 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
IJCAI
2007
13 years 9 months ago
A Study of Residual Supports in Arc Consistency
In an Arc Consistency (AC) algorithm, a residual support, or residue, is a support that has been stored during a previous execution of the procedure which determines if a value is ...
Christophe Lecoutre, Fred Hemery
NETWORKING
2008
13 years 9 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi
SIROCCO
2008
13 years 9 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
PDPTA
2007
13 years 9 months ago
Scalable Overlay Multicast Tree Construction for Media Streaming
Overlay networks have become popular in recent times for content distribution and end-system multicasting of media streams. In the latter case, the motivation is based on the lack...
Gabriel Parmer, Richard West, Gerald Fry
« Prev « First page 2553 / 2590 Last » Next »