14518 search results - page 390 / 2904 » Two Problems for Sophistication |
153
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
182
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
175
click to vote
COMPUTER
1999
15 years 6 months ago
1999
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
173
click to vote
IJCAI
2003
15 years 8 months ago
2003
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
185
click to vote
MP
2008
15 years 6 months ago
2008
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...