Sciweavers

298 search results - page 8 / 60
» ideal 2010
Sort
View
75
Voted
MOR
2010
118views more  MOR 2010»
14 years 8 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
INFOCOM
2010
IEEE
14 years 8 months ago
Design and Analysis of a Robust Pipelined Memory System
Abstract—Many network processing applications require wirespeed access to large data structures or a large amount of flowlevel data, but the capacity of SRAMs is woefully inadeq...
Hao Wang, Haiquan (Chuck) Zhao, Bill Lin, Jun Xu
ITS
2010
Springer
128views Multimedia» more  ITS 2010»
15 years 1 months ago
Can Affect Be Detected from Intelligent Tutoring System Interaction Data? - A Preliminary Study
This study attempted to determine if it is possible to create an automatic affect detector using a combination of semantic and keystroke data. While the resulting models attained d...
Elizabeth A. Anglo, Ma. Mercedes T. Rodrigo
INFORMATIKTAGE
2010
14 years 8 months ago
Context- and Domain-Aware Semantic Web Services
: This research proposal introduces an approach for Semantic Web Services that includes context information when querying a service. Thereby, a mapping between context information ...
Sascha Roth, Bernhard Humm, Michael Rebstock
EVOW
2010
Springer
15 years 4 months ago
Multi-Objective Probability Collectives
We describe and evaluate a multi-objective optimisation (MOO) algorithm that works within the Probability Collectives (PC) optimisation framework. PC is an alternative approach to ...
Antony Waldock, David Corne