Sciweavers

972 search results - page 102 / 195
» Using Preference Order in Ontologies
Sort
View
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 10 months ago
Local search for stable marriage problems
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
SAC
2008
ACM
13 years 9 months ago
A constraint hierarchies approach to geometric constraints on sketches
We propose an approach that uses preferences on the constraints in order to deal with over-constrained geometric constraint problems. This approach employs constraint hierarchies,...
Christophe Jermann, Hiroshi Hosobe
IAJIT
2010
96views more  IAJIT 2010»
13 years 8 months ago
A Data Mashup for Dynamic Composition of Adaptive Courses
: This paper presents a novel adaptive course composition system that based on mashing up learning content in a web application. The system includes three major components, static ...
Mohammed Al-Zoube, Baha Khasawneh
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 10 months ago
Capacitated Caching Games
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Na...
CATA
2003
13 years 11 months ago
Efficient Even Distribution of Power Consumption in Wireless Sensor Networks
One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the e...
Ioan Raicu