1204 search results - page 64 / 241 » Termination of Polynomial Programs |
SIGMOD
1997
ACM
15 years 4 months ago
1997
ACM
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...
118
click to vote
ACSW
2004
15 years 2 months ago
2004
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 ...
USENIX
2007
15 years 2 months ago
2007
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...
107
Voted
AAECC
2007
Springer
15 years 22 days ago
2007
Springer
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...
100
Voted
CCGRID
2007
IEEE
15 years 7 months ago
2007
IEEE
Typical computational grid users target only a single cluster and have to estimate the runtime of their jobs. Job schedulers prefer short-running jobs to maintain a high system ut...