Sciweavers

1568 search results - page 82 / 314
» The problem of examination questions in algorithmics
Sort
View
CCE
2010
15 years 1 months ago
Optimizing the design of complex energy conversion systems by Branch and Cut
The paper examines the applicability of mathematical programming methods to the simultaneous optimization of the structure and the operational parameters of a combined-cycle-based...
Turang Ahadi-Oskui, Stefan Vigerske, Ivo Nowak, Ge...
AIM
2005
15 years 4 months ago
If Not Turing's Test, Then What?
If it is true that good problems produce good science, then it will be worthwhile to identify good problems, and even more worthwhile to discover the attributes that make them goo...
Paul R. Cohen
FORMATS
2003
Springer
15 years 9 months ago
Folk Theorems on the Determinization and Minimization of Timed Automata
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
Stavros Tripakis
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
15 years 5 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
WAW
2007
Springer
113views Algorithms» more  WAW 2007»
15 years 10 months ago
Local Computation of PageRank Contributions
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...