Sciweavers

2100 search results - page 201 / 420
» Fundamentals of the problem
Sort
View
SIAMSC
2010
144views more  SIAMSC 2010»
14 years 11 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
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 2 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
105
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
Towards a Theory of Robust Localization Against Malicious Beacon Nodes
—Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundament...
Sheng Zhong, Murtuza Jadliwala, Shambhu J. Upadhya...
90
Voted
AAAI
2004
15 years 2 months ago
Towards Autonomic Computing: Adaptive Job Routing and Scheduling
Computer systems are rapidly becoming so complex that maintaining them with human support staffs will be prohibitively expensive and inefficient. In response, visionaries have beg...
Shimon Whiteson, Peter Stone
115
Voted
CDC
2010
IEEE
138views Control Systems» more  CDC 2010»
14 years 7 months ago
Sensor-based robot deployment algorithms
Abstract-- In robot deployment problems, the fundamental issue is to optimize a steady state performance measure that depends on the spatial configuration of a group of robots. For...
Jerome Le Ny, George J. Pappas