Sciweavers

11949 search results - page 2165 / 2390
» Some results on (a:b)-choosability
Sort
View
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
15 years 7 months 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...
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
15 years 7 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
WINE
2005
Springer
161views Economy» more  WINE 2005»
15 years 7 months ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari
CP
2005
Springer
15 years 7 months ago
Search and Inference in AI Planning
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
Hector Geffner
98
Voted
CSCW
2004
ACM
15 years 7 months ago
Sometimes you need to see through walls: a field study of application programming interfaces
Information hiding is one of the most important and influential principles in software engineering. It prescribes that software modules hide implementation details from other modu...
Cleidson R. B. de Souza, David F. Redmiles, Li-Te ...
« Prev « First page 2165 / 2390 Last » Next »