Sciweavers

4940 search results - page 271 / 988
» On the Complexity of Universal Programs
Sort
View
INTERSENSE
2006
ACM
16 years 16 days ago
Programming wireless sensor networks with logical neighborhoods
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
Luca Mottola, Gian Pietro Picco
KRDB
2003
111views Database» more  KRDB 2003»
15 years 8 months ago
A Framework for Answering Queries using Multiple Representation and Inference Techniques
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
Nicholas L. Cassimatis
PPDP
2007
Springer
16 years 21 days ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
CHI
2009
ACM
16 years 7 months ago
The accidental tutor: overlaying an intelligent tutor on an existing user interface
Intelligent Tutoring Systems (ITSs) have been shown to have dramatic impact on student learning [9]. However, these gains have been mostly in topics in which the interface has bee...
Liz Blankenship, Stephen B. Gilbert, Stephen Bless...
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 10 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...