Sciweavers

1226 search results - page 215 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
ATAL
2008
Springer
15 years 1 months ago
Suspending and resuming tasks in BDI agents
Intelligent agents designed to work in complex, dynamic environments must respond robustly and flexibly to environmental and circumstantial changes. An agent must be capable of de...
John Thangarajah, James Harland, David N. Morley, ...
CORR
2006
Springer
109views Education» more  CORR 2006»
14 years 12 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
CN
2000
128views more  CN 2000»
14 years 11 months ago
The Network Workbench: network simulation software for academic investigation of Internet concepts
Simulation offers significant advantages as a basis for academic projects in computer networking. many unimportant details can be abstracted away, and also because simulations can...
J. Mark Pullen
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
15 years 3 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
ESAW
2006
Springer
15 years 3 months ago
Using Constraints and Process Algebra for Specification of First-Class Agent Interaction Protocols
Abstract. Current approaches to multi-agent interaction involve specifying protocols as sets of possible interactions, and hard-coding decision mechanisms into agent programs in or...
Tim Miller, Peter McBurney