56 search results - page 10 / 12 » Decorous Lower Bounds for Minimum Linear Arrangement |
CP
2004
Springer
14 years 3 days ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
COCO
2009
Springer
14 years 1 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
DCC
2002
IEEE
14 years 6 months ago
2002
IEEE
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
INFOCOM
2003
IEEE
13 years 12 months ago
2003
IEEE
—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we desc...
WIOPT
2006
IEEE
14 years 21 days ago
2006
IEEE
Abstract— The objective of the paper is to provide qualitative insight into the global effects of distributed mechanisms, such as carrier sense multiple access (CSMA) and rate co...