698 search results - page 16 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
160
click to vote
DCC
2008
IEEE
16 years 5 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
146
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
152
click to vote
CCE
2004
15 years 5 months ago
2004
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
156
click to vote
SYNASC
2006
IEEE
15 years 12 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
134
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We revisit the problem of designing the profit-maximizing single-item auction, solved by Myerson in his seminal paper for the case in which bidder valuations are independently dis...