Sciweavers

Share
AUSAI
2007
Springer
8 years 8 months ago
Planning as Satisfiability with Relaxed $-Step Plans
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
Martin Wehrle, Jussi Rintanen
PARLE
1989
8 years 8 months ago
The Expressive Power of Simple Parallelism
We explore an algebraic language for networks consisting of a xed number of reactive units, communicating synchronously over a xed linking structure. The language has only two ope...
Joachim Parrow
PPSN
1992
Springer
8 years 8 months ago
Non-Linear Genetic Representations
The limitations of linear chromosomes and conventional recombination operators are reviewed. It is argued that there are at least three classes of problems for which such represen...
Nicholas J. Radcliffe
AGENTS
1997
Springer
8 years 8 months ago
TAIPE: Tactical Assistants for Interaction Planning and Execution
Downsizing the number of operators controlling complex systems can increase the decision-making demands on remaining operators, particularly in crisis situations. An answer to thi...
Edmund H. Durfee, Marcus J. Huber, Michael Kurnow,...
TES
2001
Springer
8 years 8 months ago
Security for Distributed E-Service Composition
Current developments show that tomorrow’s information systems and applications will no longer be based on monolithic architectures that encompass all the functionality. Rather, t...
Stefan Seltzsam, Stephan Börzsönyi, Alfo...
IFIP
2009
Springer
8 years 9 months ago
An Algebra for Trust Dilution and Trust Fusion
Trust dilution and trust fusion are two operators that are used to calculate transitive trust in a trust network. Various implementations of these operators already exist but are n...
Baptiste Alcalde, Sjouke Mauw
HAPTICS
2003
IEEE
8 years 9 months ago
Motion Guidance Experiments with Scooter Cobot
Cobots assist humans by mechanically guiding motion along software-defined paths or surfaces. Cobot design has been extensively studied previously. This paper reports the first sy...
Eng Seng Boy, Etienne Burdet, Chee Leong Teo, Jame...
GECCO
2004
Springer
8 years 9 months ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
8 years 9 months ago
Softening the Structural Difficulty in Genetic Programming with TAG-Based Representation and Insertion/Deletion Operators
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
Nguyen Xuan Hoai, Robert I. McKay
ICDE
2007
IEEE
221views Database» more  ICDE 2007»
8 years 10 months ago
Flexible Multi-Threaded Scheduling for Continuous Queries over Data Streams
A variety of real-world applications share the property that data arrives in form of transient streams. Data stream management systems (DSMS) provide convenient solutions to the p...
Michael Cammert, Christoph Heinz, Jürgen Kr&a...
books