Sciweavers

948 search results - page 112 / 190
» What can we achieve by arbitrary announcements
Sort
View
JCP
2007
118views more  JCP 2007»
13 years 8 months ago
Tutoring an Entire Game with Dynamic Strategy Graphs: The Mixed-Initiative Sudoku Tutor
Abstract— In this paper, we develop a mixed-initiative intelligent tutor for the game of Sudoku called MITS. We begin by developing a characterization of the strategies used in S...
Allan Caine, Robin Cohen
INFOCOM
2007
IEEE
14 years 3 months ago
Moore: An Extendable Peer-to-Peer Network Based on Incomplete Kautz Digraph with Constant Degree
— The topological properties of peer-to-peer overlay networks are critical factors that dominate the performance of these systems. Several non-constant and constant degree interc...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
DCOSS
2007
Springer
14 years 3 months ago
A Connectivity Based Partition Approach for Node Scheduling in Sensor Networks
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
Yong Ding, Chen Wang, Li Xiao
ICALP
2001
Springer
14 years 1 months ago
Routing in Trees
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
Pierre Fraigniaud, Cyril Gavoille
DAGM
2006
Springer
14 years 17 days ago
Sparse Patch-Histograms for Object Classification in Cluttered Images
Abstract. We present a novel model for object recognition and detection that follows the widely adopted assumption that objects in images can be represented as a set of loosely cou...
Thomas Deselaers, Andre Hegerath, Daniel Keysers, ...