6455 search results - page 162 / 1291 » Research problems |
280
click to vote
PC
2011
15 years 1 months ago
2011
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
175
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
165
click to vote
VLDB
1990
ACM
15 years 10 months ago
1990
ACM
Non-monotonic knowledge evolutions and exceptions constitute a complex theoritical and practical problem. The state of the art shows a rich and surprising diversity of approaches....
182
click to vote
AAMAS
2008
Springer
15 years 6 months ago
2008
Springer
As the scale and scope of distributed and multi-agent systems grow, it becomes increasingly important to design and manage the participants' interactions. The potential for b...
147
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
We give new recursive constructions of complete caps in PG(n, 2). We approach the problem of constructing caps with low dependency via the doubling construction and comparison to ...