Sciweavers

9631 search results - page 174 / 1927
» The Costs of Using JXTA
Sort
View
189
Voted
ISAAC
2003
Springer
97views Algorithms» more  ISAAC 2003»
16 years 7 days ago
Equilibria for Networks with Malicious Users
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavio...
George Karakostas, Anastasios Viglas
ADC
2006
Springer
110views Database» more  ADC 2006»
15 years 10 months ago
A heuristic approach to cost-efficient fragmentation and allocation of complex value databases
The quality of database distribution design, which involves fragmentation and allocation, should be assessed by the performance of a system. In particular, this applies to non-rel...
Hui Ma, Klaus-Dieter Schewe, Qing Wang
VLDB
2002
ACM
126views Database» more  VLDB 2002»
15 years 6 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...
MICS
2008
124views more  MICS 2008»
15 years 5 months ago
Community Structures of Networks
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
William Y. C. Chen, Andreas W. M. Dress, Winking Q...
ISOLA
2010
Springer
15 years 5 months ago
Worst-Case Analysis of Heap Allocations
In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst...
Wolfgang Puffitsch, Benedikt Huber, Martin Schoebe...