14548 search results - page 443 / 2910 » The Optimal Path-Matching Problem |
165
click to vote
FSTTCS
2010
Springer
15 years 5 months ago
2010
Springer
Given a zero-sum infinite game we examine the question if players have optimal memoryless deterministic strategies. It turns out that under some general conditions the problem for...
185
click to vote
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
This paper considers the problem of reduced-order observer design. A design procedure is proposed in which the impulse response of the observer is treated as the solution of a gene...
219
click to vote
EOR
2010
15 years 5 months ago
2010
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
295
click to vote
INFOCOM
2009
IEEE
16 years 2 months ago
2009
IEEE
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
173
click to vote
CEC
2007
IEEE
16 years 2 months ago
2007
IEEE
—In recent years a lot of progress has been made in understanding the behavior of evolutionary computation methods for single- and multi-objective problems. Our aim is to analyze...