Sciweavers

655 search results - page 86 / 131
» Evolving Heuristics for Planning
Sort
View
127
Voted
ICDE
2010
IEEE
198views Database» more  ICDE 2010»
15 years 7 months ago
Power-aware data analysis in sensor networks
Abstract— Sensor networks have evolved to a powerful infrastructure component for event monitoring in many application scenarios. In addition to simple filter and aggregation op...
Daniel Klan, Katja Hose, Marcel Karnstedt, Kai-Uwe...
131
Voted
GLOBECOM
2010
IEEE
14 years 12 months ago
Routing and Spectrum Allocation in OFDM-Based Optical Networks with Elastic Bandwidth Allocation
Orthogonal Frequency Division Multiplexing (OFDM) has been recently proposed as a modulation technique for optical networks, due to its good spectral efficiency and impairment tole...
Kostas Christodoulopoulos, Ioannis Tomkos, Emmanou...
NIPS
1993
15 years 3 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 5 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
AAAI
1994
15 years 3 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex