Sciweavers

306 search results - page 44 / 62
» On the Minimal Uncompletable Word Problem
Sort
View
SIAMDM
2010
149views more  SIAMDM 2010»
13 years 5 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
SIAMSC
2010
144views more  SIAMSC 2010»
13 years 5 months ago
An Exponentially Convergent Nonpolynomial Finite Element Method for Time-Harmonic Scattering from Polygons
In recent years nonpolynomial finite element methods have received increasing attention for the efficient solution of wave problems. As with their close cousin the method of parti...
A. H. Barnett, Timo Betcke
EPIA
2001
Springer
13 years 12 months ago
A Temporal Planning System for Time-Optimal Planning
Dealing with temporality on actions presents an important challenge to AI planning. Unlike Graphplan-based planners which alternate levels of propositions and actions in a regular ...
Antonio Garrido Tejero, Eva Onaindia, Federico Bar...
SIROCCO
2007
13 years 8 months ago
Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
In a sensor network the sensors, or nodes, obtain data and have to communicate these data to a central node. Because sensors are battery powered they are highly energy constrained....
Peter Korteweg, Alberto Marchetti-Spaccamela, Leen...
ANOR
2008
90views more  ANOR 2008»
13 years 7 months ago
Multiple orders per job batch scheduling with incompatible jobs
: The growth in demand for semiconductors has been accompanied by intense competition between semiconductor manufacturers to satisfy customer on-time delivery needs. This paper is ...
Vishnu Erramilli, Scott J. Mason