Sciweavers

4131 search results - page 683 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
GD
1998
Springer
15 years 11 months ago
Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
15 years 11 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...
VLDB
1998
ACM
95views Database» more  VLDB 1998»
15 years 11 months ago
RainForest - A Framework for Fast Decision Tree Construction of Large Datasets
Classification of large datasets is an important data mining problem. Many classification algorithms have been proposed in the literature, but studies have shown that so far no al...
Johannes Gehrke, Raghu Ramakrishnan, Venkatesh Gan...
OOPSLA
1997
Springer
15 years 11 months ago
Parasitic Methods: An Implementation of Multi-Methods for Java
In an object-oriented programming language, method selection is (usually) done at run-time using the class of the receiver. Some object-orientedlanguages(such as CLOS) have multi-...
John Boyland, Giuseppe Castagna
ACMICEC
2007
ACM
127views ECommerce» more  ACMICEC 2007»
15 years 10 months ago
Decentralized task allocation using magnet: an empirical evaluation in the logistics domain
This paper presents a decentralized task allocation method that can handle allocation of tasks with time and precedence constraints in a multi-agent setting where not all informat...
Mark Hoogendoorn, Maria L. Gini, Catholijn M. Jonk...