716 search results - page 57 / 144 » Algorithmic Issues in Coding Theory |
117
Voted
AAAI
2000
15 years 3 months ago
2000
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
140
Voted
SDM
2008
SIAM
15 years 4 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
132
Voted
SOFSEM
2010
Springer
15 years 11 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
110
click to vote
AOSD
2007
ACM
15 years 6 months ago
2007
ACM
Beginning with BETA, a range of programming language mechanisms such as virtual classes (class-valued attributes of objects) have been developed to allow inheritance in the presen...
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...