505 search results - page 27 / 101 » On the Minimality and Decomposability of Constraint Networks |
GECCO
2006
Springer
14 years 4 days ago
2006
Springer
We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is ...
IOR
2007
13 years 8 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
A computationally efficient distributed beamforming technique for multi-user relay networks is developed. The channel state information is assumed to be known at the relays or de...
AAAI
1996
13 years 9 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
ICIP
2003
IEEE
14 years 10 months ago
2003
IEEE
This paperpresentsa novel framework for streamingvideo over a Differentiated Services (DifPjew) network that jointly considers video source coding. packet classification and error...