Sciweavers

14158 search results - page 425 / 2832
» Generalized switch-setting problems
Sort
View
ARSCOM
2007
115views more  ARSCOM 2007»
15 years 5 months ago
Minimal Universal Bipartite Graphs
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
Vadim V. Lozin, Gábor Rudolf
ICRA
2005
IEEE
123views Robotics» more  ICRA 2005»
15 years 10 months ago
SLAM via Variable Reduction from Constraint Maps
- The two dominant forms of SLAM are based on Extended Kalman Filtering and Consistent Pose Estimation. We show that these are particular subsets of a more general view of the SLAM...
Kurt Konolige
PPAM
2005
Springer
15 years 10 months ago
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...
Krzysztof Giaro, Marek Kubale
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
15 years 10 months ago
Polyline Fitting of Planar Points Under Min-sum Criteria
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k join...
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehl...
PADL
2004
Springer
15 years 10 months ago
USA-Smart: Improving the Quality of Plans in Answer Set Planning
In this paper we show how CR-Prolog, a recent extension of A-Prolog, was used in the successor of USA-Advisor (USA-Smart) in order to improve the quality of the plans returned. The...
Marcello Balduccini