Sciweavers

1982 search results - page 390 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
93
Voted
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
14 years 11 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
AIPS
2009
15 years 23 days ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
PLDI
2012
ACM
13 years 2 months ago
Diderot: a parallel DSL for image analysis and visualization
Research scientists and medical professionals use imaging technology, such as computed tomography (CT) and magnetic resonance imaging (MRI) to measure a wide variety of biological...
Charisee Chiw, Gordon Kindlmann, John Reppy, Lamon...
MM
2010
ACM
125views Multimedia» more  MM 2010»
14 years 12 months ago
Tenor: making coding practical from servers to smartphones
It has been theoretically shown that performing coding in networked systems, including Reed-Solomon codes, fountain codes, and random network coding, has a clear advantage with re...
Hassan Shojania, Baochun Li
P2P
2005
IEEE
189views Communications» more  P2P 2005»
15 years 5 months ago
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks
A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-l...
Curt Cramer, Thomas Fuhrmann