Sciweavers

498 search results - page 69 / 100
» A Theory of Complexity for Continuous Time Systems
Sort
View
NOMS
2008
IEEE
181views Communications» more  NOMS 2008»
14 years 1 months ago
Coordinated management of power usage and runtime performance
— With the continued growth of computing power and reduction in physical size of enterprise servers, the need for actively managing electrical power usage in large datacenters is...
Malgorzata Steinder, Ian Whalley, James E. Hanson,...
APCSAC
2005
IEEE
14 years 1 months ago
The Challenges of Massive On-Chip Concurrency
Moore’s law describes the growth in on-chip transistor density, which doubles every 18 to 24 months and looks set to continue for at least a decade and possibly longer. This grow...
Kostas Bousias, Chris R. Jesshope
KR
1992
Springer
13 years 11 months ago
Abductive Plan Recognition and Diagnosis: A Comprehensive Empirical Evaluation
While it has been realized for quite some time within AI that abduction is a general model of explanation for a variety of tasks, there have been no empirical investigations into ...
Hwee Tou Ng, Raymond J. Mooney
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
14 years 7 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
COLT
1993
Springer
13 years 11 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum