Sciweavers

12863 search results - page 2292 / 2573
» Dynamic Data Mining
Sort
View
AGENTS
1998
Springer
15 years 8 months ago
Learning Situation-Dependent Costs: Improving Planning from Probabilistic Robot Execution
Physical domains are notoriously hard to model completely and correctly, especially to capture the dynamics of the environment. Moreover, since environments change, it is even mor...
Karen Zita Haigh, Manuela M. Veloso
SIGCOMM
1998
ACM
15 years 8 months ago
QoSMIC: Quality of Service Sensitive Multicast Internet Protocol
In this paper, we present, QoSMIC, a multicast protocol for the Internet that supports QoS-sensitive routing, and minimizes the importance of a priori con guration decisions such...
Michalis Faloutsos, Anindo Banerjea, Rajesh Pankaj
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 8 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
ISPW
1996
IEEE
15 years 8 months ago
Feedback, evolution and software technology
A 1968 study of the software process led, inter alia, to the observation that the software process constitutes a feedback system. Attempts at its management and improvement must t...
M. M. Lehman
PDIS
1993
IEEE
15 years 8 months ago
The Kendall Square Query Decomposer
d Abstract:: ACM SIGMOD Record 22 (4), Dec. 1993) RM93 Rahm, E., Marek, R.: Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems. Proc 19th VL...
David S. Reiner
« Prev « First page 2292 / 2573 Last » Next »