Sciweavers

2783 search results - page 530 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
IJCAI
2001
15 years 2 months ago
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
Alan M. Frisch, Timothy J. Peugniez
IJCAI
2001
15 years 2 months ago
Executing Reactive, Model-based Programs through Graph-based Temporal Planning
In the future, webs of unmanned air and space vehicles will act together to robustly perform elaborate missions in uncertain environments. We coordinate these systems by introduci...
Phil Kim, Brian C. Williams, Mark Abramson
NSDI
2004
15 years 2 months ago
Measurement and Analysis of Spyware in a University Environment
Over the past few years, a relatively new computing phenomenon has gained momentum: the spread of "spyware." Though most people are aware of spyware, the research commun...
Stefan Saroiu, Steven D. Gribble, Henry M. Levy
P2PKM
2004
15 years 2 months ago
Merging G-Grid P2P Systems While Preserving Their Autonomy
Peer-to-Peer (P2P) systems share and manage huge amounts of data and resources distributed across a large number of machines. In pure P2P environments the control is totally decent...
Gianluca Moro, Gabriele Monti, Aris M. Ouksel
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 2 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani