Sciweavers

2313 search results - page 79 / 463
» On Heuristic Time Hierarchies
Sort
View
SPE
1998
129views more  SPE 1998»
15 years 6 months ago
Timing Trials, or the Trials of Timing: Experiments with Scripting and User-Interface Languages
This paper describes some basic experiments to see how fast various popular scripting and user-interface languages run on a spectrum of representative tasks. We found enormous var...
Brian W. Kernighan, Christopher J. Van Wyk
IJCNN
2000
IEEE
15 years 10 months ago
Input Window Size and Neural Network Predictors
Neural Network approaches to time series prediction are briefly discussed, and the need to specify an appropriately sized input window identified. Relevant theoretical results fro...
Ray J. Frank, Neil Davey, S. P. Hunt
DAC
2001
ACM
16 years 7 months ago
A Quick Safari Through the Reconfiguration Jungle
Cost effective systems use specialization to optimize factors such as power consumption, processing throughput, flexibility or combinations thereof. Reconfigurable systems obtain ...
Patrick Schaumont, Ingrid Verbauwhede, Kurt Keutze...
IPCO
2007
126views Optimization» more  IPCO 2007»
15 years 7 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
CORR
2008
Springer
124views Education» more  CORR 2008»
15 years 6 months ago
A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
Daniel Raible, Henning Fernau