Sciweavers

350 search results - page 30 / 70
» Uncertainty in Soft Constraint Problems
Sort
View
GD
2005
Springer
14 years 1 months ago
A Mixed-Integer Program for Drawing High-Quality Metro Maps
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
Martin Nöllenburg, Alexander Wolff
AIMSA
2008
Springer
14 years 2 months ago
Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
Zhipeng Lü, Jin-Kao Hao
FUZZIEEE
2007
IEEE
14 years 2 months ago
Soft Target Based Obstacle Avoidance for Car-like Mobile Robot in Dynamic Environment
— The real time flexible operation of a car-like mobile robot with nonholonomic constraints in dynamic environment is still a very challenging problem. The difficulty lies in t...
Yougen Chen, Seiji Yasunobu
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
13 years 8 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
CPAIOR
2010
Springer
14 years 16 days ago
Constraint Reasoning with Uncertain Data Using CDF-Intervals
Interval coefficients have been introduced in OR and CP to specify uncertain data in order to provide reliable solutions to convex models. The output is generally a solution set, ...
Aya Saad, Carmen Gervet, Slim Abdennadher