Sciweavers

4198 search results - page 114 / 840
» In search of lost time
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 6 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
IEAAIE
2009
Springer
16 years 20 days ago
Using Genetic Process Mining Technology to Construct a Time-Interval Process Model
Nowadays, some process information is represented by a process model. To understand process executed in many activities, process mining technologies are now extensively studied to...
Chieh-Yuan Tsai, I-Ching Chen
GECCO
2009
Springer
125views Optimization» more  GECCO 2009»
15 years 10 months ago
Preserving population diversity for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
Abel Garcia-Najera
CORR
2006
Springer
159views Education» more  CORR 2006»
15 years 6 months ago
Structural Alignments of pseudo-knotted RNA-molecules in polynomial time
An RNA molecule is structured on several layers. The primary and most obvious structure is its sequence of bases, i.e. a word over the alphabet {A, C, G, U}. The higher structure i...
Michael Brinkmeier
FOCS
2000
IEEE
15 years 10 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount