Sciweavers

3359 search results - page 273 / 672
» A Simplified Idea Algorithm
Sort
View
243
Voted
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
16 years 21 days ago
Planning with Continuous Actions in Partially Observable Environments
Abstract— We present a simple randomized POMDP algorithm for planning with continuous actions in partially observable environments. Our algorithm operates on a set of reachable b...
Matthijs T. J. Spaan, Nikos A. Vlassis
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
16 years 19 days ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
GECCO
2005
Springer
114views Optimization» more  GECCO 2005»
16 years 19 days ago
Exploiting disruption aversion to control code bloat
The authors employ multiple crossovers as a novel natural extension to crossovers as a mixing operator. They use this as a framework to explore the ideas of code growth. Empirical...
Jason Stevens, Robert B. Heckendorn, Terence Soule
ICN
2005
Springer
16 years 19 days ago
Maximizing System Value Among Interested Packets While Satisfying Time and Energy Constraints
: Data filtering is an important approach to reduce energy consumption. Following this idea, Interest is used as a constraint to filter uninterested data in sensor networks. Within...
Lei Shu, Sungyoung Lee, Xiaoling Wu, Jie Yang
140
Voted
VLDB
2005
ACM
85views Database» more  VLDB 2005»
16 years 18 days ago
Inspector Joins
The key idea behind Inspector Joins is that during the I/O partitioning phase of a hash-based join, we have the opportunity to look at the actual data itself and then use this kno...
Shimin Chen, Anastassia Ailamaki, Phillip B. Gibbo...