Sciweavers

13987 search results - page 464 / 2798
» The Two Guards Problem
Sort
View
LWA
2007
15 years 8 months ago
Semantic Perspectives on Knowledge Management and E-Learning
Knowledge Management (KM) and E-Learning (EL) applications interface more and more as their objects of concern consist in ’captured knowledge’ resp. ’learning objects’, i....
Andrea Kohlhase
NIPS
2003
15 years 8 months ago
Clustering with the Connectivity Kernel
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
Bernd Fischer, Volker Roth, Joachim M. Buhmann
ATAL
2010
Springer
15 years 8 months ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish
186
Voted
ACTA
2008
136views more  ACTA 2008»
15 years 7 months ago
Two-dimensional packing with conflicts
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
Leah Epstein, Asaf Levin, Rob van Stee
IPL
2008
95views more  IPL 2008»
15 years 7 months ago
Efficient algorithms for finding interleaving relationship between sequences
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hs...