Sciweavers

4218 search results - page 20 / 844
» Complete sets of cooperations
Sort
View
CC
2005
Springer
153views System Software» more  CC 2005»
14 years 1 months ago
Completeness Analysis for Incomplete Object-Oriented Programs
We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
Jingling Xue, Phung Hua Nguyen
COOP
2004
13 years 9 months ago
A decision support framework for cooperation in make-to-order production
This paper proposes a method which assists the firms for cooperating in make-to-order production. We especially focus on the operational decision levels of manufacturing companies ...
Emmanuelle Monsarrat, Cyril Briand, Patrick Esquir...
DALT
2005
Springer
14 years 1 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
STACS
2009
Springer
14 years 2 months ago
Forward Analysis for WSTS, Part I: Completions
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
Alain Finkel, Jean Goubault-Larrecq
DAGSTUHL
2008
13 years 9 months ago
Complete Interval Arithmetic and its Implementation
: Let IIR be the set of closed and bounded intervals of real numbers. Arithmetic in IIR can be defined via the power set IPIR of real numbers. If divisors containing zero are exclu...
Ulrich W. Kulisch