436 search results - page 20 / 88 » Decomposing constraint systems: equivalences and computation... |
ISORC
2009
IEEE
14 years 3 months ago
2009
IEEE
The UML goal of being a general-purpose modeling language discards the possibility to adopt too precise and strict a semantics. Users are to refine or define the semantics in th...
QEST
2008
IEEE
14 years 3 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
IPCO
2008
13 years 10 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
JEI
2010
13 years 7 months ago
2010
Abstract. We present an innovative approach to the objective quality evaluation that could be computed using the mean difference between the original and tested images in different...