Sciweavers

1142 search results - page 118 / 229
» Set Variables and Local Search
Sort
View
DAC
1998
ACM
16 years 4 months ago
Efficient Coloring of a Large Spectrum of Graphs
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
Darko Kirovski, Miodrag Potkonjak
IROS
2008
IEEE
139views Robotics» more  IROS 2008»
15 years 9 months ago
Estimating landmark locations from geo-referenced photographs
Abstract— The problem of estimating the positions of landmarks using a mobile robot equipped with a camera has intensively been studied in the past. In this paper, we consider a ...
Henrik Kretzschmar, Cyrill Stachniss, Christian Pl...
115
Voted
HM
2010
Springer
133views Optimization» more  HM 2010»
15 years 4 months ago
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...
Luca Di Gaspero, Johannes Gärtner, Nysret Mus...
ECCV
2006
Springer
16 years 5 months ago
Located Hidden Random Fields: Learning Discriminative Parts for Object Detection
This paper introduces the Located Hidden Random Field (LHRF), a conditional model for simultaneous part-based detection and segmentation of objects of a given class. Given a traini...
Ashish Kapoor, John M. Winn
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
15 years 6 months ago
Decision Tree Induction: How Effective is the Greedy Heuristic?
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
Sreerama K. Murthy, Steven Salzberg