1204 search results - page 129 / 241 » Termination of Polynomial Programs |
117
click to vote
IJCAI
1989
15 years 1 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
150
Voted
IBERAMIA
2010
Springer
14 years 10 months ago
2010
Springer
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
126
Voted
WALCOM
2007
IEEE
15 years 1 months ago
2007
IEEE
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
108
Voted
ICDT
1995
ACM
15 years 4 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
95
Voted
ICIP
2003
IEEE
16 years 2 months ago
2003
IEEE
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...