Sciweavers

9842 search results - page 346 / 1969
» Problem complexity
Sort
View
APPML
2007
92views more  APPML 2007»
15 years 7 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
DAGSTUHL
2006
15 years 8 months ago
Constraint Satisfaction with Succinctly Specified Relations
Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the liter...
Hubie Chen, Martin Grohe
EVOW
2009
Springer
16 years 1 months ago
University Course Timetabling with Genetic Algorithm: A Laboratory Excercises Case Study
Abstract. This paper describes the application of a hybrid genetic algorithm to a real-world instance of the university course timetabling problem. We address the timetabling of la...
Zlatko Bratkovic, Tomislav Herman, Vjera Omrcen, M...
169
Voted
LDVF
2000
102views more  LDVF 2000»
15 years 6 months ago
Imperatives, Commitment and Action: Towards a Constraint-based Model
The aim of this paper is to provide an analysis of the function of imperatives in dialogue. In particular, the focus is on the use of logically complex imperatives (e.g., `Say hel...
Paul Piwek
COMPGEOM
1996
ACM
15 years 11 months ago
Smallest Enclosing Cylinders
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...
Elmar Schömer, Jürgen Sellen, Marek Teic...