Sciweavers

4218 search results - page 128 / 844
» Complete sets of cooperations
Sort
View
FSTTCS
2007
Springer
14 years 4 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
JCIT
2008
138views more  JCIT 2008»
13 years 10 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
ISCA
2005
IEEE
128views Hardware» more  ISCA 2005»
14 years 3 months ago
An Evaluation Framework and Instruction Set Architecture for Ion-Trap Based Quantum Micro-Architectures
: The theoretical study of quantum computation has yielded efficient algorithms for some traditionally hard problems. Correspondingly, experimental work on the underlying physical...
Steven Balensiefer, Lucas Kreger-Stickles, Mark Os...
TPHOL
2005
IEEE
14 years 3 months ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown
ICDE
1994
IEEE
103views Database» more  ICDE 1994»
14 years 2 months ago
A Multi-Set Extended Relational Algebra - A Formal Approach to a Practical Issue
The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples in a relation. Many database languages and systems do require multi-set place, the hi...
Paul W. P. J. Grefen, Rolf A. de By