Sciweavers

2976 search results - page 194 / 596
» On the bounded integer programming
Sort
View
SPIN
2010
Springer
15 years 4 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
AMW
2011
14 years 10 months ago
Bag Equivalence of Bounded Symmetry-Degree Conjunctive Queries with Inequalities
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
Mingmin Chen, Todd J. Green
WECWIS
2003
IEEE
118views ECommerce» more  WECWIS 2003»
15 years 11 months ago
Trade Determination in Multi-Attribute Exchanges
Electronic exchanges are double-sided marketplaces that allow multiple buyers to trade with multiple sellers, with aggregation of demand and supply across the bids to maximize the...
S. Kameshwaran, Y. Narahari
IEEEPACT
1999
IEEE
15 years 10 months ago
A Cost-Effective Clustered Architecture
In current superscalar processors, all floating-point resources are idle during the execution of integer programs. As previous works show, this problem can be alleviated if the fl...
Ramon Canal, Joan-Manuel Parcerisa, Antonio Gonz&a...
CP
2008
Springer
15 years 8 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang