Sciweavers

8413 search results - page 276 / 1683
» Ordering Problem Subgoals
Sort
View
DAM
2002
96views more  DAM 2002»
15 years 6 months ago
The structure of stable marriage with indifference
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
David Manlove
CISIS
2011
IEEE
14 years 6 months ago
Agent-based Pickup and Delivery Planning: The Learnable Evolution Model Approach
—The Dynamic Vehicle Routing Problem (DVRP) is an optimization problem in which agents deliver orders that are not known in advance to the routing. Partial solutions need to be a...
Janusz Wojtusiak, Tobias Warden, Otthein Herzog
TOG
2012
271views Communications» more  TOG 2012»
13 years 9 months ago
Mass splitting for jitter-free parallel rigid body simulation
We present a parallel iterative rigid body solver that avoids common artifacts at low iteration counts. In large or real-time simulations, iteration is often terminated before con...
Richard Tonge, Feodor Benevolenski, Andrey Voroshi...
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
16 years 8 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
IPPS
2006
IEEE
16 years 16 days ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch