Sciweavers

4403 search results - page 304 / 881
» Galois Theory of Algorithms
Sort
View
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
16 years 20 days ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
GECCO
2005
Springer
142views Optimization» more  GECCO 2005»
16 years 7 days ago
Choreogenetics: the generation of choreographic variants through genetic mutations and selection
In this paper, a genetic algorithm is introduced to generate variants of a choreographic sequence, which are then selected using different criteria. The mutation phase of the algo...
François-Joseph Lapointe
COMPGEOM
2004
ACM
16 years 4 days ago
Range counting over multidimensional data streams
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou
201
Voted
IPPS
2003
IEEE
16 years 2 min ago
Using Hybrid Alignment for Iterative Sequence Database Searches
Progressive sequence model refinement by means of iterative searches is an effective technique for high sensitivity database searches and is currently employed in popular tools s...
Yuheng Li, Mario Lauria, Ralf Bundschuh
193
Voted
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
15 years 11 months ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan