3229 search results - page 290 / 646 » The Theory of Timed Automata |
141
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the ...
142
click to vote
ISAAC
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
148
click to vote
COMPGEOM
2006
ACM
16 years 23 days ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
132
click to vote
ICNC
2005
Springer
16 years 8 days ago
2005
Springer
Fingertip pulsations (plethysmograms) were found to obey chaotic dynamics [1]. We applied chaos theory to analysis of the time series of plethysmograms under various human physio-p...
147
click to vote
COCO
1998
Springer
15 years 11 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...