Sciweavers

7978 search results - page 352 / 1596
» Combining shared-coin algorithms
Sort
View
RR
2009
Springer
15 years 11 months ago
Search for More Declarativity
Abstract. Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed searc...
Simon Brodt, François Bry, Norbert Eisinger
EVOW
2001
Springer
15 years 11 months ago
An Evolutionary Annealing Approach to Graph Coloring
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
Dimitris Fotakis, Spiridon D. Likothanassis, Stama...
INFOCOM
2000
IEEE
15 years 11 months ago
The Throughput of Data Switches with and without Speedup
— In this paper we use fluid model techniques to establish two results concerning the throughput of data switches. For an input-queued switch (with no speedup) we show that a ma...
J. G. Dai, Balaji Prabhakar
SIGGRAPH
1997
ACM
15 years 11 months ago
Interactive multiresolution mesh editing
We describe a multiresolution representation for meshes based on subdivision, which is a natural extension of the existing patch-based surface representations. Combining subdivisi...
Denis Zorin, Peter Schröder, Wim Sweldens
COLT
1993
Springer
15 years 10 months ago
Learning from a Population of Hypotheses
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
Michael J. Kearns, H. Sebastian Seung