Sciweavers

1366 search results - page 111 / 274
» Modularizing Contexted Constraints
Sort
View
CAV
2004
Springer
151views Hardware» more  CAV 2004»
15 years 3 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
ISAAC
2003
Springer
210views Algorithms» more  ISAAC 2003»
15 years 4 months ago
The Student-Project Allocation Problem
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
David J. Abraham, Robert W. Irving, David Manlove
ICSOC
2007
Springer
15 years 5 months ago
Service Selection Based on Non-functional Properties
Service-oriented Architecture supports software to be composed from services dynamically. Selecting and composing appropriate services according to business process, policies and n...
Stephan Reiff-Marganiec, HongQing Yu, Marcel Tilly
ICTAC
2004
Springer
15 years 4 months ago
Duration Calculus: A Real-Time Semantic for B
Among the possible approaches for expressing real-time problems with the B method, two are dominant : the use of the usual B mechanisms to define temporal constraints on the one h...
Samuel Colin, Georges Mariano, Vincent Poirriez
PAKDD
2004
ACM
164views Data Mining» more  PAKDD 2004»
15 years 4 months ago
FP-Bonsai: The Art of Growing and Pruning Small FP-Trees
Abstract. In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this pap...
Francesco Bonchi, Bart Goethals