Sciweavers

171 search results - page 31 / 35
» An Investigation of the Course-Section Assignment Problem
Sort
View
WDAG
2005
Springer
67views Algorithms» more  WDAG 2005»
14 years 1 months ago
What Can Be Implemented Anonymously?
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
Rachid Guerraoui, Eric Ruppert
SELMAS
2004
Springer
14 years 1 months ago
Systematic Integration Between Requirements and Architecture
Software systems of today are characterized by the increasing size, complexity, distribution and heterogeneity. Understanding and supporting the interaction between software requi...
Lúcia R. D. Bastos, Jaelson Brelaz de Castr...
INFOCOM
2009
IEEE
14 years 3 months ago
Graceful Network Operations
—A significant fraction of network events (such as topology or route changes) and the resulting performance degradation stem from premeditated network management and operational...
Saqib Raza, Yuanchen Zhu, Chen-Nee Chuah
MICRO
2002
IEEE
143views Hardware» more  MICRO 2002»
14 years 1 months ago
Effective instruction scheduling techniques for an interleaved cache clustered VLIW processor
Clustering is a common technique to overcome the wire delay problem incurred by the evolution of technology. Fully-distributed architectures, where the register file, the functio...
Enric Gibert, F. Jesús Sánchez, Anto...
ATAL
2009
Springer
14 years 3 months ago
Evaluating hybrid constraint tightening for scheduling agents
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
James C. Boerkoel Jr., Edmund H. Durfee