Sciweavers

16596 search results - page 228 / 3320
» Generalized Assignment Problems
Sort
View
GD
2006
Springer
15 years 10 months ago
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
Michael B. Dillencourt, David Eppstein, Michael T....
SIGECOM
2008
ACM
141views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
On the communication requirements of verifying the VCG outcome
We consider the amount of communication required to verify the outcome of the Vickrey-Clarke-Groves (VCG) mechanism: an efficient allocation together with incentivizing VCG paymen...
Sébastien Lahaie, David C. Parkes
SIAMJO
2000
86views more  SIAMJO 2000»
15 years 6 months ago
On the SQAP-Polytope
The SQAP-polytope was associated to quadratic assignment problems with a certain symmetric objective function structure by Rijal (1995) and Padberg and Rijal (1996). We derive a te...
Michael Jünger, Volker Kaibel
FLAIRS
2008
15 years 7 months ago
A Framework for Evaluating Semantic Knowledge in Problem-Solving-Based Intelligent Tutoring Systems
We describe a framework for building intelligent tutoring systems that offer an advanced evaluation of learners' semantic knowledge. The knowledge model makes a pedagogical d...
Philippe Fournier-Viger, Roger Nkambou, Andr&eacut...
WAOA
2004
Springer
127views Algorithms» more  WAOA 2004»
15 years 12 months ago
Better Bounds for Minimizing SONET ADMs
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
Leah Epstein, Asaf Levin