3455 search results - page 587 / 691 » Generalized Game Trees |
161
Voted
SENSYS
2006
ACM
15 years 10 months ago
2006
ACM
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...
144
click to vote
SIGCSE
2006
ACM
15 years 10 months ago
2006
ACM
This paper describes a significant redesign of the introductory courses at the University of Washington that has led to increased enrollments, increased student satisfaction and a...
139
click to vote
ICPP
2005
IEEE
15 years 10 months ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
147
click to vote
IDEAS
2005
IEEE
15 years 10 months ago
2005
IEEE
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
134
click to vote
ISCAS
2005
IEEE
15 years 10 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...