Sciweavers

3221 search results - page 119 / 645
» Termination of Linear Programs
Sort
View
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
14 years 3 months ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
14 years 1 months ago
Picture Programming Project
Visual Language (VL) system development is getting increasingly sophisticated in part due to the arduous nature of user interface (UI) code development. This typically involves id...
Nita Goyal, Charles Hoch, Ravi Krishnamurthy, Bria...
ACSW
2004
13 years 11 months ago
Applying Online Gradient Descent Search to Genetic Programming for Object Recognition
This paper describes an approach to the use of gradient descent search in genetic programming (GP) for object classification problems. In this approach, pixel statistics are used ...
William D. Smart, Mengjie Zhang
USENIX
2007
13 years 12 months ago
Exploring Recovery from Operating System Lockups
Operating system lockup errors can render a computer unusable by preventing the execution other programs. Watchdog timers can be used to recover from a lockup by resetting the pro...
Francis M. David, Jeffrey C. Carlyle, Roy H. Campb...
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 9 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai