Sciweavers

15485 search results - page 3037 / 3097
» Computing Optimal Subsets
Sort
View
SENSYS
2003
ACM
14 years 27 days ago
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag...
ATAL
2003
Springer
14 years 27 days ago
Role allocation and reallocation in multiagent teams: towards a practical analysis
Despite the success of the BDI approach to agent teamwork, initial role allocation (i.e. deciding which agents to allocate to key roles in the team) and role reallocation upon fai...
Ranjit Nair, Milind Tambe, Stacy Marsella
GD
2003
Springer
14 years 26 days ago
Fixed-Location Circular-Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
Alon Efrat, Cesim Erten, Stephen G. Kobourov
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
14 years 26 days ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
14 years 26 days ago
Inherent Fault Tolerance in Evolved Sorting Networks
This poster paper summarizes our research on fault tolerance arising as a by-product of the evolutionary computation process. Past research has shown evidence of robustness emergin...
Rob Shepherd, James A. Foster
« Prev « First page 3037 / 3097 Last » Next »