Sciweavers

494 search results - page 71 / 99
» Heap Building Bounds
Sort
View
SGP
2003
15 years 3 days ago
CLODs: Dual Hierarchies for Multiresolution Collision Detection
We present “contact levels of detail” (CLOD), a novel concept for multiresolution collision detection. Given a polyhedral model, our algorithm automatically builds a “dual h...
Miguel A. Otaduy, Ming C. Lin
SIROCCO
2000
15 years 2 days ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman
CORR
2008
Springer
95views Education» more  CORR 2008»
14 years 10 months ago
An Indirect Genetic Algorithm for a Nurse Scheduling Problem
This paper describes a Genetic Algorithms approach to a manpower-scheduling problem arising at a major UK hospital. Although Genetic Algorithms have been successfully used for sim...
Uwe Aickelin, Kathryn A. Dowsland
DISOPT
2008
138views more  DISOPT 2008»
14 years 10 months ago
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...
ENTCS
2008
110views more  ENTCS 2008»
14 years 10 months ago
Game-Based Probabilistic Predicate Abstraction in PRISM
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
Mark Kattenbelt, Marta Z. Kwiatkowska, Gethin Norm...