Sciweavers

2200 search results - page 192 / 440
» Bloch's Constant is Computable
Sort
View
LCN
2007
IEEE
16 years 25 days ago
Reliability Control for Aggregation in Wireless Sensor Networks
— Data aggregation is a method used in sensor networks to reduce the amount of messages transported. By aggregating, the data contained in several messages is fused into one sing...
Jonathan P. Benson, Tony O'Donovan, Cormac J. Sree...
LICS
2007
IEEE
16 years 25 days ago
Separating DAG-Like and Tree-Like Proof Systems
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
Phuong Nguyen
LICS
2007
IEEE
16 years 25 days ago
Higher-Order Matching, Games and Automata
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
Colin Stirling
AIED
2007
Springer
16 years 23 days ago
Intelligent Tutoring and Human Tutoring in Small Groups: An Empirical Comparison
The efficacy of a tutoring system for pre-algebra instruction plus human tutoring was compared to instruction provided to small groups of middle school students by experienced huma...
Carole R. Beal, Erin Shaw, Mike Birch
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
16 years 22 days ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy