1300 search results - page 217 / 260 » Constraint satisfaction problems and global cardinality cons... |
JNW
2007
14 years 9 months ago
2007
— We propose a mathematical programming model of the routing problem in multi-hop wireless networks that takes into account quality of service requirements considering bandwidth ...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
is a challenging problem. We consider here abstract specifications consisting of a composition of components and a controller given in the form of a set of interactions and a prior...
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
Atomicity is a desirable property that safeguards application consistency for service compositions. A service composition exhibiting this property could either complete or cancel ...
ICCAD
2000
IEEE
15 years 2 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
ISNN
2005
Springer
15 years 3 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...