Sciweavers

3016 search results - page 451 / 604
» The Online Transportation Problem
Sort
View
KAIS
2006
111views more  KAIS 2006»
15 years 4 months ago
Efficient string matching with wildcards and length constraints
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return e...
Gong Chen, Xindong Wu, Xingquan Zhu, Abdullah N. A...
NETWORK
2006
84views more  NETWORK 2006»
15 years 4 months ago
VON: a scalable peer-to-peer network for virtual environments
: The scalability of large-scale networked virtual environments (NVEs) suchastoday's Massively Multiplayer Online Games (MMOGs) faces inherent limits imposed by the client-ser...
Shun-Yun Hu, Jui-Fa Chen, Tsu-Han Chen
SIGCSE
2008
ACM
138views Education» more  SIGCSE 2008»
15 years 4 months ago
Debugging: the good, the bad, and the quirky -- a qualitative analysis of novices' strategies
A qualitative analysis of debugging strategies of novice Java programmers is presented. The study involved 21 CS2 students from seven universities in the U.S. and U.K. Subjects &q...
Laurie Murphy, Gary Lewandowski, Renée McCa...
SIGPRO
2008
106views more  SIGPRO 2008»
15 years 4 months ago
Propagator-based methods for recursive subspace model identification
The problem of the online identification of multi-input multi-output (MIMO) state-space models in the framework of discrete-time subspace methods is considered in this paper. Seve...
Guillaume Mercère, Laurent Bako, Sté...
TCS
2008
15 years 4 months ago
Scheduling to maximize participation
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...