Sciweavers

8780 search results - page 266 / 1756
» On the Feasibility of Consistent Computations
Sort
View
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
16 years 2 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
CPAIOR
2005
Springer
16 years 29 days ago
Constraint Programming Based Column Generation for Employee Timetabling
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
INFFUS
2006
137views more  INFFUS 2006»
15 years 7 months ago
Bipolar possibility theory in preference modeling: Representation, fusion and optimal solutions
The bipolar view in preference modeling distinguishes between negative and positive preferences. Negative preferences correspond to what is rejected, considered unacceptable, whil...
Salem Benferhat, Didier Dubois, Souhila Kaci, Henr...
SMA
2008
ACM
131views Solid Modeling» more  SMA 2008»
15 years 7 months ago
Streaming tetrahedral mesh optimization
Improving the quality of tetrahedral meshes is an important operation in many scientific computing applications. Meshes with badly shaped elements impact both the accuracy and con...
Tian Xia, Eric Shaffer
FOIKS
2008
Springer
15 years 9 months ago
A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases
Abstract In this paper we present a new rule-based approach for consistency preserving view updating in deductive databases. Based on rule transformations performed during schema d...
Andreas Behrend, Rainer Manthey