Sciweavers

2410 search results - page 69 / 482
» Multiset Ordering Constraints
Sort
View
APN
2009
Springer
15 years 11 months ago
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
In previous works we defined ν-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverab...
Fernando Rosa Velardo, David de Frutos-Escrig
139
Voted
MCU
1998
119views Hardware» more  MCU 1998»
15 years 6 months ago
DNA Computing Based on Splicing: Universality Results
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
Gheorghe Paun
142
Voted
JSAC
2010
142views more  JSAC 2010»
15 years 3 months ago
Extreme value FEC for reliable broadcasting in wireless networks
—The advent of practical rateless codes enables implementation of highly efficient packet-level forward error correction (FEC) strategies for reliable data broadcasting in loss-...
Weiyao Xiao, David Starobinski
ECAI
2004
Springer
15 years 10 months ago
Boosting Systematic Search by Weighting Constraints
In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...
Frédéric Boussemart, Fred Hemery, Ch...
CPAIOR
2010
Springer
15 years 3 months ago
Boosting Set Constraint Propagation for Network Design
Abstract. This paper reconsiders the deployment of synchronous optical networks (SONET), an optimization problem naturally expressed in terms of set variables. Earlier approaches, ...
Justin Yip, Pascal Van Hentenryck, Carmen Gervet