Sciweavers

16596 search results - page 3004 / 3320
» Generalized Assignment Problems
Sort
View
TFM
2009
Springer
252views Formal Methods» more  TFM 2009»
16 years 1 months ago
Abstraction and Modelling: A Complementary Partnership
action and Modelling - a complementary partnership” 10h30 – 11h 00 Coffee break 11h-12h30 Session 1 “Model Transformation: Foundations” Algebraic models for bidirectional m...
Jeffrey Kramer
191
Voted
FCT
2009
Springer
16 years 1 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
SPAA
2004
ACM
16 years 3 days ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
JCT
2010
113views more  JCT 2010»
15 years 5 months ago
Equations resolving a conjecture of Rado on partition regularity
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
Boris Alexeev, Jacob Tsimerman

Publication
211views
17 years 4 months ago
Congestion Avoidance in Computer Networks with A Connecitonless Network Layer: Part IV: A Selective Binary Feedback Scheme for G
With increasingly widespread use of computer networks, and the use of varied technology for the interconnection of computers, congestion is a significant problem. In this report, w...
K. Ramakrishnan and R. Jain,
« Prev « First page 3004 / 3320 Last » Next »