Sciweavers

4137 search results - page 628 / 828
» On the number of matchings of a tree
Sort
View
RTCSA
2000
IEEE
13 years 11 months ago
Efficient resource management for hard real-time communication over differentiated services architectures
We propose an efficient strategy for resource management for scalable QoS guaranteed real-time communication services. This strategy is based on sink trees, and is particularly we...
Byung-Kyu Choi, Riccardo Bettati
VLDB
1995
ACM
194views Database» more  VLDB 1995»
13 years 11 months ago
Eager Aggregation and Lazy Aggregation
Efficient processing of aggregation queries is essential for decision support applications. This paper describes a class of query transformations, called eager aggregation and lat...
Weipeng P. Yan, Per-Åke Larson
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
13 years 11 months ago
Robust symbolic regression with affine arithmetic
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
Cassio Pennachin, Moshe Looks, João A. de V...
EUROPAR
2009
Springer
13 years 11 months ago
Enabling High Data Throughput in Desktop Grids through Decentralized Data and Metadata Management: The BlobSeer Approach
Whereas traditional Desktop Grids rely on centralized servers for data management, some recent progress has been made to enable distributed, large input data, using to peer-to-peer...
Bogdan Nicolae, Gabriel Antoniu, Luc Bougé
AAAI
2008
13 years 10 months ago
Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders
Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alterna...
Lirong Xia, Vincent Conitzer