Sciweavers

200 search results - page 40 / 40
» Approximation Algorithms for Scheduling on Multiple Machines
Sort
View
SODA
2003
ACM
157views Algorithms» more  SODA 2003»
13 years 6 months ago
Competitive queueing policies for QoS switches
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
Nir Andelman, Yishay Mansour, An Zhu
ICCAD
2006
IEEE
131views Hardware» more  ICCAD 2006»
14 years 2 months ago
High-level synthesis challenges and solutions for a dynamically reconfigurable processor
A dynamically reconfigurable processor (DRP) is designed to achieve high area efficiency by switching reconfigurable data paths dynamically. Our DRP architecture has a stand alone...
Takao Toi, Noritsugu Nakamura, Yoshinosuke Kato, T...
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
13 years 11 months ago
Outlier Detection for Fine-grained Load Balancing in Database Clusters
Recent industry trends towards reducing the costs of ownership in large data centers emphasize the need for database system techniques for both automatic performance tuning and ef...
Jin Chen, Gokul Soundararajan, Madalin Mihailescu,...
IUI
2005
ACM
13 years 10 months ago
Intelligent data entry assistant for XML using ensemble learning
XML has emerged as the primary standard of data representation and data exchange [13]. Although many software tools exist to assist the XML implementation process, data must be ma...
Danico Lee, Costas Tsatsoulis
NN
2002
Springer
115views Neural Networks» more  NN 2002»
13 years 4 months ago
A self-organising network that grows when required
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
Stephen Marsland, Jonathan Shapiro, Ulrich Nehmzow