Sciweavers

4378 search results - page 279 / 876
» On the Complexity of Ordered Colourings
Sort
View
ICTAI
1993
IEEE
15 years 10 months ago
Short Term Unit-Commitment Using Genetic Algorithms
Unit commitment is a complex decision-making process because of multiple constraints which must not be violated while nding the optimal or a near-optimal commitment schedule. This...
Dipankar Dasgupta, Douglas R. McGregor
VLDB
1994
ACM
129views Database» more  VLDB 1994»
15 years 10 months ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos
CINQ
2004
Springer
180views Database» more  CINQ 2004»
15 years 10 months ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann
182
Voted
CHI
2006
ACM
15 years 10 months ago
Representation of interwoven surfaces in 2 1/2 D drawing
The state-of-the-art in computer drawing programs is based on a number of concepts that are over two decades old. One such concept is the use of layers for ordering the surfaces i...
Keith Wiley, Lance R. Williams
DLOG
2007
15 years 9 months ago
Action Based ABox Update: an Example from the Chemical Compound Formulation
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...
Alessandro Mosca, Matteo Palmonari