Sciweavers

4894 search results - page 691 / 979
» Dynamic Abstraction Planning
Sort
View
CONCUR
2000
Springer
15 years 11 months ago
Process Spaces
This paper introduces process spaces, a unified theory of interacting systems. The trait, abstract executions, leads to a simple and general set formalism. For concurrent systems ...
Radu Negulescu
DEXA
2000
Springer
95views Database» more  DEXA 2000»
15 years 11 months ago
Formalizing Workflows Using the Event Calculus
The event calculus is a logic programming formalism for representing events and their effects especially in database applications. This paper presents the use of the event calculus...
Nihan Kesim Cicekli, Yakup Yildirim
AGENTS
1999
Springer
15 years 11 months ago
Shopbot Economics
Abstract. Shopbots are agents that search the Internet for information pertaining to the price and quality of goods or services. With the advent of shopbots, a dramatic reduction i...
Jeffrey O. Kephart, Amy R. Greenwald
INFOCOM
1999
IEEE
15 years 11 months ago
CEDAR: a Core-Extraction Distributed Ad Hoc Routing Algorithm
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...
Prasun Sinha, Raghupathy Sivakumar, Vaduvur Bhargh...
EUROGP
1999
Springer
151views Optimization» more  EUROGP 1999»
15 years 11 months ago
Phenotype Plasticity in Genetic Programming: A Comparison of Darwinian and Lamarckian Inheritance Schemes
Abstract We consider a form of phenotype plasticity in Genetic Programming (GP). This takes the form of a set of real-valued numerical parameters associated with each individual, a...
Anna Esparcia-Alcázar, Ken Sharman