Sciweavers

3663 search results - page 603 / 733
» Problems in the ontology of computer programs
Sort
View
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
15 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
INFOCOM
2005
IEEE
15 years 3 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
ICS
2001
Tsinghua U.
15 years 2 months ago
Optimizing strategies for telescoping languages: procedure strength reduction and procedure vectorization
At Rice University, we have undertaken a project to construct a framework for generating high-level problem solving languages that can achieve high performance on a variety of pla...
Arun Chauhan, Ken Kennedy
ATAL
2008
Springer
14 years 12 months ago
Solving two-person zero-sum repeated games of incomplete information
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
Andrew Gilpin, Tuomas Sandholm
CORR
2011
Springer
219views Education» more  CORR 2011»
14 years 5 months ago
Active Markov Information-Theoretic Path Planning for Robotic Environmental Sensing
Recent research in multi-robot exploration and mapping has focused on sampling environmental fields, which are typically modeled using the Gaussian process (GP). Existing informa...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla