Sciweavers

9842 search results - page 1356 / 1969
» Problem complexity
Sort
View
BMCBI
2006
152views more  BMCBI 2006»
15 years 7 months ago
A two-stage approach for improved prediction of residue contact maps
Background: Protein topology representations such as residue contact maps are an important intermediate step towards ab initio prediction of protein structure. Although improvemen...
Alessandro Vullo, Ian Walsh, Gianluca Pollastri
IPPS
2003
IEEE
16 years 18 days ago
Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques
Component-based models represent a dominant trend in the construction of wide-area network applications, making possible the integration of diverse functionality contained in modu...
Tatiana Kichkaylo, Anca-Andreea Ivan, Vijay Karamc...
ATAL
2010
Springer
15 years 8 months ago
Evolving policy geometry for scalable multiagent learning
A major challenge for traditional approaches to multiagent learning is to train teams that easily scale to include additional agents. The problem is that such approaches typically...
David B. D'Ambrosio, Joel Lehman, Sebastian Risi, ...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 7 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
MOBIHOC
2004
ACM
16 years 6 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
« Prev « First page 1356 / 1969 Last » Next »