Sciweavers

355 search results - page 39 / 71
» A general, fully distributed multi-agent planning algorithm
Sort
View
127
Voted
WWW
2008
ACM
16 years 4 months ago
Exploiting semantic web technologies to model web form interactions
Form mapping is the key problem that needs to be solved in order to get access to the hidden web. Currently available solutions for fully automatic mapping are not ready for comme...
Bernhard Krüpl, Robert Baumgartner, Wolfgang ...
151
Voted
WIOPT
2006
IEEE
15 years 9 months ago
Fairness and throughput guarantees with maximal scheduling in multi-hop wireless networks
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
Saswati Sarkar, Prasanna Chaporkar, Koushik Kar
PPOPP
2009
ACM
16 years 4 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 10 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
125
Voted
TSMC
2008
229views more  TSMC 2008»
15 years 3 months ago
A Comprehensive Survey of Multiagent Reinforcement Learning
Multiagent systems are rapidly finding applications in a variety of domains, including robotics, distributed control, telecommunications, and economics. The complexity of many task...
Lucian Busoniu, Robert Babuska, Bart De Schutter