9631 search results - page 1550 / 1927 » The Costs of Using JXTA |
185
click to vote
AIMSA
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
194
click to vote
AINA
2008
IEEE
15 years 9 months ago
2008
IEEE
It is important to design an energy efficient data gathering tree structure for wireless sensor networks. As for the energy efficiency, network's overall energy consumption an...
240
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
176
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
177
click to vote
ASSETS
2008
ACM
15 years 9 months ago
2008
ACM
The Flote is a wind instrument designed for people with limited mobility. Past work in this area has failed to deliver the musical expressiveness expected of an instrument while m...