4372 search results - page 545 / 875 » Algorithmic Theories of Everything |
326
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
233
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
197
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
189
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
202
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...