14518 search results - page 265 / 2904 » Two Problems for Sophistication |
360
click to vote
FAW
2010
Springer
15 years 6 months ago
2010
Springer
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
175
click to vote
IWPEC
2009
Springer
16 years 4 days ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
163
click to vote
TAMC
2009
Springer
16 years 4 days ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
159
click to vote
CEC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization pr...
125
click to vote
DESRIST
2009
Springer
15 years 10 months ago
2009
Springer
Design science emphasizes the connection between knowledge and practice by showing that we can produce scientific knowledge by designing useful things. However, without further g...