Sciweavers

1068 search results - page 35 / 214
» On Space Bounded Server Algorithms
Sort
View
COR
2010
146views more  COR 2010»
14 years 9 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
CP
2008
Springer
14 years 11 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
Vibhav Gogate, Rina Dechter
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
14 years 11 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
ESA
2007
Springer
100views Algorithms» more  ESA 2007»
15 years 3 months ago
Radix Sorting with No Extra Space
It is well known that n integers in the range [1, nc ] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1, U] can be sorted i...
Gianni Franceschini, S. Muthukrishnan, Mihai Patra...
COLT
2010
Springer
14 years 7 months ago
Convex Games in Banach Spaces
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
Karthik Sridharan, Ambuj Tewari