Sciweavers

11212 search results - page 427 / 2243
» Semi-persistent Data Structures
Sort
View
CP
2004
Springer
15 years 10 months ago
Unary Resource Constraint with Optional Activities
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
Petr Vilím, Roman Barták, Ondrej Cep...
CGI
2003
IEEE
15 years 10 months ago
Reaching Volumes Generated by Means of Octal Trees and Cartesian Constraints
This paper presents a system to analyze the reachability of the human body. The inverse kinematics technique is employed to find which regions of space are reachable using a certa...
I. Rodríguez, Manuel Peinado, Ronan Boulic,...
HPCN
1997
Springer
15 years 10 months ago
Boolean Function Manipulation on a Parallel System Using BDDs
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
F. Bianchi, Fulvio Corno, Maurizio Rebaudengo, Mat...
CC
2005
Springer
195views System Software» more  CC 2005»
15 years 8 months ago
Compilation of Generic Regular Path Expressions Using C++ Class Templates
Various techniques for the navigation and matching of data structures using path expressions have been the subject of extensive investigations. No matter whether such techniques ar...
Luca Padovani
PODC
2010
ACM
15 years 8 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer