Sciweavers

1725 search results - page 235 / 345
» Relaxed genetic programming
Sort
View
ICALP
2005
Springer
15 years 3 months ago
Up-to Techniques for Weak Bisimulation
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
Damien Pous
WEA
2005
Springer
105views Algorithms» more  WEA 2005»
15 years 3 months ago
Inferring AS Relationships: Dead End or Lively Beginning?
Recent techniques for inferring business relationships between ASs [3, 8] have yielded maps that have extremely few invalid BGP paths in the terminology of Gao [9]. However, some ...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, B...
CP
2004
Springer
15 years 3 months ago
Deriving Filtering Algorithms from Constraint Checkers
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...
Nicolas Beldiceanu, Mats Carlsson, Thierry Petit
HYBRID
2004
Springer
15 years 3 months ago
Almost ASAP Semantics: From Timed Models to Timed Implementations
In this paper, we introduce a parametric semantics for timed controllers called the Almost ASAP semantics. This semantics is a relaxation of the usual ASAP3 semantics (also called ...
Martin De Wulf, Laurent Doyen, Jean-Françoi...
ICRA
1999
IEEE
114views Robotics» more  ICRA 1999»
15 years 2 months ago
An Effective Method to Reduce Inventory in Job Shops
Inventory plays a major role in deciding the overall manufacturing costs, and a good scheduling system should balance the on-time delivery of products versus low work-in-process (W...
Peter B. Luh, Xiaohui Zhou, Robert N. Tomastik