Sciweavers

7123 search results - page 1183 / 1425
» The Ordered Set of Rough Sets
Sort
View
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
15 years 12 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
GECCO
2003
Springer
160views Optimization» more  GECCO 2003»
15 years 12 months ago
Using Genetic Algorithms for Data Mining Optimization in an Educational Web-Based System
This paper presents an approach for classifying students in order to predict their final grade based on features extracted from logged data in an education web-based system. A comb...
Behrouz Minaei-Bidgoli, William F. Punch
COMPGEOM
2010
ACM
15 years 11 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
ICTAI
2002
IEEE
15 years 11 months ago
Distributed Graphplan
(Appears as a regular paper in the Proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Washington D.C, IEEE Computer Society, Nov. 2002, p...
Mark Iwen, Amol Dattatraya Mali
RECSYS
2009
ACM
15 years 11 months ago
Critiquing recommenders for public taste products
Critiquing-based recommenders do not require users to state all of their preferences upfront or rate a set of previously experienced products. Compared to other types of recommend...
Pearl Pu, Maoan Zhou, Sylvain Castagnos
« Prev « First page 1183 / 1425 Last » Next »