1568 search results - page 38 / 314 » The problem of examination questions in algorithmics |
ISSAC
2001
Springer
15 years 2 months ago
2001
Springer
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
102
click to vote
GRAPHICSINTERFACE
1996
14 years 11 months ago
1996
Many educators have used Algorithm Visualization (AV) to teach students of computer science about how computer algorithms work. Our study sheds light on two important questions: (...
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. There are conflicting reports over whether multiple independent runs of genetic algorithms (GAs) with small populations can reach solutions of higher quality or can fin...
ECCC
2007
14 years 10 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
DM
2010
14 years 10 months ago
2010
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors o...