Sciweavers

6693 search results - page 728 / 1339
» Methods of Automatic Algorithm Generation
Sort
View
COR
2007
112views more  COR 2007»
15 years 6 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
DAC
2001
ACM
16 years 7 months ago
High-Quality Operation Binding for Clustered VLIW Datapaths
Clustering is an effective method to increase the available parallelism in VLIW datapaths without incurring severe penalties associated with large number of register file ports. E...
Viktor S. Lapinskii, Margarida F. Jacome, Gustavo ...
ICPR
2008
IEEE
16 years 1 months ago
Model-based visual self-localization using geometry and graphs
In this paper, a geometric approach for global selflocalization based on a world-model and active stereo vision is introduced. The method uses class specific object recognition a...
David Israel Gonzalez-Aguirre, Tamim Asfour, Eduar...
ILP
2007
Springer
16 years 1 months ago
Learning with Kernels and Logical Representations
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
Paolo Frasconi
ICRA
2006
IEEE
144views Robotics» more  ICRA 2006»
16 years 26 days ago
Adapting Probabilistic Roadmaps to Handle Uncertain Maps
Abstract— Randomized motion planning techniques are responsible for many of the recent successes in robot control. However, most motion planning algorithms assume perfect and com...
Patrycja E. Missiuro, Nicholas Roy