Sciweavers

1291 search results - page 196 / 259
» Arithmetic program paths
Sort
View
103
Voted
WCET
2007
15 years 1 months ago
WCET Analysis: The Annotation Language Challenge
Worst-case execution time (WCET) analysis is indispensable for the successful design and development of systems, which, in addition to their functional constraints, have to satisf...
Raimund Kirner, Jens Knoop, Adrian Prantl, Markus ...
EUROGP
2010
Springer
167views Optimization» more  EUROGP 2010»
15 years 1 months ago
An Analysis of Genotype-Phenotype Maps in Grammatical Evolution
We present an analysis of the genotype-phenotype map in Grammatical Evolution (GE). The standard map adopted in GE is a depth-first expansion of the non-terminal symbols during the...
David Fagan, Michael O'Neill, Edgar Galván ...
123
Voted
ANOR
2008
171views more  ANOR 2008»
15 years 26 days ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
96
Voted
JIPS
2006
71views more  JIPS 2006»
15 years 21 days ago
Scenario-based 3D Objects Synthesizing System Design
: This paper proposes the framework of the scenario-based 3D image synthesizing system that allows common users who envision a scenario in their mind to realize it into the segment...
Ji-Seung Nam, Hui Gao, Mi-Young Kang, Kyoung-Tae K...
74
Voted
ORL
2008
77views more  ORL 2008»
15 years 20 days ago
A short proof of the VPN Tree Routing Conjecture on ring networks
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...
Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo...