805 search results - page 78 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
157
click to vote
AGP
1999
IEEE
15 years 8 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
135
Voted
TASE
2008
IEEE
15 years 4 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
156
Voted
RSS
2007
15 years 6 months ago
2007
— In this paper we present an implicit time-stepping scheme for multibody systems with intermittent contact by incorporating the contact constraints as a set of complementarity a...
124
click to vote
ISSS
1997
IEEE
15 years 8 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...
130
click to vote
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
—This paper addresses the problem of optimal rate allocation for video streaming in a multi-path peer-to-peer mesh network. We present a distributed rate allocation algorithm tha...