Sciweavers

13841 search results - page 2354 / 2769
» Algorithms and Constraint Programming
Sort
View
COMPGEOM
1998
ACM
15 years 9 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan
131
Voted
UIST
1998
ACM
15 years 9 months ago
Internet Scrapbook: Automating Web Browsing Tasks by Demonstration
This paper describes a programming-by-demonstration system, called Internet Scrapbook, which allows users with little programming skill to automate repetitive browsing tasks. With...
Atsushi Sugiura, Yoshiyuki Koseki
KES
1998
Springer
15 years 9 months ago
Attractor systems and analog computation
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
Hava T. Siegelmann, Shmuel Fishman
146
Voted
ICCAD
1997
IEEE
101views Hardware» more  ICCAD 1997»
15 years 9 months ago
Minimum area retiming with equivalent initial states
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
Naresh Maheshwari, Sachin S. Sapatnekar
ISPAN
1997
IEEE
15 years 9 months ago
A method for estimating optimal unrolling times for nested loops
Loop unrolling is one of the most promising parallelization techniques, because the nature of programs causes most of the processing time to be spent in their loops. Unrolling not...
Akira Koseki, Hideaki Komatsu, Yoshiaki Fukazawa
« Prev « First page 2354 / 2769 Last » Next »