Sciweavers

2822 search results - page 339 / 565
» Mining Optimized Ranges
Sort
View
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
14 years 2 months ago
Discrete dynamical genetic programming in XCS
A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to neural networks. This paper presents results fr...
Richard Preen, Larry Bull
IWPEC
2009
Springer
14 years 2 months ago
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
Peter Damaschke
ICRA
2008
IEEE
116views Robotics» more  ICRA 2008»
14 years 2 months ago
A pure probabilistic approach to range-only SLAM
— Range-Only SLAM represents a difficult problem due to the inherent ambiguity of localizing either the robot or the beacons from distance measurements only. Most previous appro...
Jose-Luis Blanco, Javier Gonzalez, Juan-Antonio Fe...
SCAM
2008
IEEE
14 years 2 months ago
Fast and Precise Points-to Analysis
—Many software engineering applications require points-to analysis. Client applications range from optimizing compilers to program development and testing environments to reverse...
Jonas Lundberg, Tobias Gutzmann, Welf Löwe
DSN
2007
IEEE
14 years 2 months ago
Minimizing Response Time for Quorum-System Protocols over Wide-Area Networks
A quorum system is a collection of sets (quorums) of servers, where any two quorums intersect. Quorumbased protocols underly modern edge-computing architectures and throughput-sca...
Florian Oprea, Michael K. Reiter