28888 search results - page 301 / 5778 » Computability and complexity in analysis |
160
click to vote
MFCS
1992
Springer
15 years 10 months ago
1992
Springer
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...
161
click to vote
TCS
2011
15 years 1 months ago
2011
Abstract. We consider the complexity of the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. The problem was supposed to be computat...
191
click to vote
ECAL
1995
Springer
15 years 10 months ago
1995
Springer
Arti cial Life and the more general area of Complex Systems does not have a uni ed theoretical framework although most theoretical work in these areas is based on simulation. This ...
167
click to vote
DATE
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper proposes extensions to the VHDL grammar and de nes new semantics in the language to model the timing behavior of high frequency buses and clock lines with multiple, dis...
165
click to vote
ORL
2006
15 years 6 months ago
2006
In this paper we derive estimates of the sample sizes required to solve a multistage stochastic programming problem with a given accuracy by the (conditional sampling) sample aver...