Sciweavers

2912 search results - page 57 / 583
» Logistic Model Trees
Sort
View
EOR
2006
130views more  EOR 2006»
13 years 11 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
SIGSOFT
2005
ACM
14 years 11 months ago
Facilitating software evolution research with kenyon
Software evolution research inherently has several resourceintensive logistical constraints. Archived project artifacts, such as those found in source code repositories and bug tr...
Jennifer Bevan, E. James Whitehead Jr., Sunghun Ki...
CAV
2004
Springer
152views Hardware» more  CAV 2004»
14 years 4 months ago
Abstract Regular Model Checking
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
Ahmed Bouajjani, Peter Habermehl, Tomás Voj...
ESSLLI
1999
Springer
14 years 3 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann
FASE
2008
Springer
14 years 24 days ago
Correctness-Preserving Configuration of Business Process Models
Abstract. Reference process models capture recurrent business operations in a given domain such as procurement or logistics. These models are intended to be configured to fit the r...
Wil M. P. van der Aalst, Marlon Dumas, Florian Got...