5093 search results - page 983 / 1019 » How Real are Real Numbers |
137
click to vote
CIKM
2006
Springer
15 years 5 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
119
click to vote
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
134
click to vote
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
148
click to vote
CSCLP
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
145
click to vote
EMSOFT
2008
Springer
15 years 4 months ago
2008
Springer
This paper presents an EDF-based algorithm, called Earliest Deadline Deferrable Portion (EDDP), for efficient scheduling of recurrent real-time tasks on multiprocessor systems. Th...