491 search results - page 60 / 99 » Avoiding Determinization |
106
click to vote
FPGA
1995
ACM
15 years 2 months ago
1995
ACM
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
88
Voted
WSC
2007
15 years 27 days ago
2007
We discuss SBatch, a simplified procedure for steady-state simulation analysis that is based on spaced batch means, incorporating many advantages of its predecessorsASAP3 and WAS...
COMPGEOM
2008
ACM
15 years 11 days ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
CONCUR
2008
Springer
15 years 11 days ago
2008
Springer
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...