Sciweavers

10907 search results - page 214 / 2182
» Constraint Based Strategies
Sort
View
INFOCOM
2006
IEEE
15 years 4 months ago
Density-Based vs. Proximity-Based Anycast Routing for Mobile Networks
— Existing anycast routing protocols solely route packets to the closest group member. In this paper, we introduce density-based anycast routing, a new anycast routing strategy p...
Vincent Lenders, Martin May, Bernhard Plattner
ICIP
2003
IEEE
16 years 12 days ago
Optimal erasure protection assignment for scalable compressed images with tree-structured dependencies
This paper is concerned with the efficient transmission of scalable compressed images with complex dependency structures over lossy communication channels. Our recent work propose...
Johnson Thie, David Taubman
RC
2002
100views more  RC 2002»
14 years 10 months ago
Efficient Interval Linear Equality Solving in Constraint Logic Programming
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
Chong-Kan Chiu, Jimmy Ho-Man Lee
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 2 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
AI
2003
Springer
15 years 4 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin