Sciweavers

1204 search results - page 108 / 241
» Termination of Polynomial Programs
Sort
View
101
Voted
IJCAI
2001
15 years 2 months ago
Graph Theoretical Characterization and Computation of Answer Sets
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
Thomas Linke
SIGSOFT
2008
ACM
16 years 1 months ago
Asynchronous exception propagation in blocked tasks
Asynchronous exception propagation is a useful alternative form of communication among threads, especially if timely propagation is ensured. However, timely propagation is impossi...
Roy Krischer, Peter A. Buhr
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
15 years 7 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
EUROGP
2005
Springer
156views Optimization» more  EUROGP 2005»
15 years 6 months ago
Evolving Rules for Document Classification
We describe a novel method for using Genetic Programming to create compact classification rules based on combinations of N-Grams (character strings). Genetic programs acquire fitne...
Laurence Hirsch, Masoud Saeedi, Robin Hirsch
74
Voted
ICSE
2010
IEEE-ACM
15 years 5 months ago
Runtime repair of software faults using event-driven monitoring
In software with emergent properties, despite the best efforts to remove faults before execution, there is a high likelihood that faults will occur during runtime. These faults c...
Chris Lewis 0002, Jim Whitehead