Sciweavers

18306 search results - page 2971 / 3662
» Algorithmics in Exponential Time
Sort
View
ICDT
2005
ACM
128views Database» more  ICDT 2005»
16 years 10 days ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
IWQOS
2005
Springer
16 years 9 days ago
Processor Sharing Flows in the Internet
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and pr...
Nandita Dukkipati, Masayoshi Kobayashi, Rui Zhang-...
PAM
2005
Springer
16 years 9 days ago
A Merged Inline Measurement Method for Capacity and Available Bandwidth
— We have proposed a new TCP version, called ImTCP (Inline measurement TCP), in [1]. The ImTCP sender adjusts the transmission intervals of data packets, and then utilizes the ar...
Cao Le Thanh Man, Go Hasegawa, Masayuki Murata
VMCAI
2005
Springer
16 years 9 days ago
On the Complexity of Error Explanation
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
Nirman Kumar, Viraj Kumar, Mahesh Viswanathan
173
Voted
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
16 years 9 days ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
« Prev « First page 2971 / 3662 Last » Next »