Sciweavers

1350 search results - page 196 / 270
» Reasoning about Staged Computation
Sort
View
ICNP
2005
IEEE
15 years 3 months ago
Typed Abstraction of Complex Network Compositions
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
15 years 3 months ago
Game Theoretic Control for Robot Teams
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
DALT
2005
Springer
15 years 3 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 3 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
ECAI
2004
Springer
15 years 3 months ago
A Formal Tutoring Process Model for Intelligent Tutoring Systems
The combination Computer Based Training systems with Artificial Intelligence and Cognitive Science has led to the development of Intelligent Tutoring Systems nearly 30 years ago. ...
Alke Martens, Adelinde Uhrmacher