Sciweavers

1710 search results - page 48 / 342
» High-Level Programs and Program Conditions
Sort
View
ANOR
2005
94views more  ANOR 2005»
13 years 7 months ago
Cover and Pack Inequalities for (Mixed) Integer Programming
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
Alper Atamtürk
ATAL
2009
Springer
14 years 2 months ago
Operational semantics of goal models in adaptive agents
Several agent-oriented software engineering methodologies address the emerging challenges posed by the increasing need of adaptive software. A common denominator of such methodolo...
Mirko Morandini, Loris Penserini, Anna Perini
CAV
2004
Springer
120views Hardware» more  CAV 2004»
14 years 1 months ago
Termination of Linear Programs
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...
Ashish Tiwari
TEC
2008
139views more  TEC 2008»
13 years 7 months ago
Genetic Programming Approaches for Solving Elliptic Partial Differential Equations
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
Andras Sobester, Prasanth B. Nair, Andy J. Keane
DSS
2006
108views more  DSS 2006»
13 years 8 months ago
Matching observed behavior and modeled behavior: An approach based on Petri nets and integer programming
Inspired by the way SAP R/3 and other transactional information systems log events, we focus on the problem to decide whether a process model and a frequency profile "fit"...
Wil M. P. van der Aalst