Sciweavers

9842 search results - page 1936 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
14 years 1 months ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
LCPC
2007
Springer
14 years 1 months ago
Modeling Relations between Inputs and Dynamic Behavior for General Programs
Program dynamic optimization, adaptive to runtime behavior changes, has become increasingly important for both performance and energy savings. However, most runtime optimizations o...
Xipeng Shen, Feng Mao
LION
2007
Springer
192views Optimization» more  LION 2007»
14 years 1 months ago
Learning While Optimizing an Unknown Fitness Surface
This paper is about Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular a novel application of RL is considered i...
Roberto Battiti, Mauro Brunato, Paolo Campigotto
LPNMR
2007
Springer
14 years 1 months ago
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
Stefan Woltran
SEMWEB
2007
Springer
14 years 1 months ago
Lightweight Community-Driven Ontology Evolution
Only few well-maintained domain ontologies can be found on the Web. The likely reasons for the lack of useful domain ontologies include that (1) informal means to convey intended m...
Katharina Siorpaes
« Prev « First page 1936 / 1969 Last » Next »