Sciweavers

2905 search results - page 233 / 581
» Formal Memetic Algorithms
Sort
View
98
Voted
ENTCS
2007
109views more  ENTCS 2007»
15 years 1 months ago
Symbolic Model Checking for Channel-based Component Connectors
The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specificatio...
Sascha Klüppelholz, Christel Baier
69
Voted
ANOR
2002
67views more  ANOR 2002»
15 years 1 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith
89
Voted
TPDS
1998
95views more  TPDS 1998»
15 years 23 days ago
Bound Performance Models of Heterogeneous Parallel Processing Systems
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
Simonetta Balsamo, Lorenzo Donatiello, Nico M. van...
102
Voted
ACL
2010
14 years 11 months ago
Untangling the Cross-Lingual Link Structure of Wikipedia
Wikipedia articles in different languages are connected by interwiki links that are increasingly being recognized as a valuable source of cross-lingual information. Unfortunately,...
Gerard de Melo, Gerhard Weikum
SIGDIAL
2010
14 years 11 months ago
Presupposition Accommodation as Exception Handling
Van der Sandt's algorithm for handling presupposition is based on a "presupposition as anaphora" paradigm and is expressed in the realm of Kamp's DRT. In recen...
Philippe de Groote, Ekaterina Lebedeva