830 search results - page 34 / 166 » Generalizing Global Constraints Based on Network Flows |
ICCAD
2003
IEEE
14 years 5 months ago
2003
IEEE
Routing for FPGAs has been a very challenging problem due to the limitation of routing resources. Although the FPGA routing problem has been researched extensively, most algorithm...
MOBIHOC
2007
ACM
14 years 8 months ago
2007
ACM
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...
COMPULOG
1999
Springer
14 years 1 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
GIS
2009
ACM
14 years 1 months ago
2009
ACM
The in-network query processing paradigm in sensor networks postulates that a query is routed among sensors and collects the answers from the sensors on its trajectory. It works f...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— Joint cooperative processing of transmitted signal from several multiple-input multiple-output (MIMO) base station (BS) antenna heads is considered for users located within a s...