Sciweavers

3016 search results - page 232 / 604
» The Online Transportation Problem
Sort
View
IAT
2005
IEEE
15 years 11 months ago
Coordinating Non Cooperative Planning Agents: Complexity Results
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...
Adriaan ter Mors, Cees Witteveen
ATMOS
2010
134views Optimization» more  ATMOS 2010»
15 years 4 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
CHI
2009
ACM
16 years 6 months ago
Two studies of opportunistic programming: interleaving web foraging, learning, and writing code
This paper investigates the role of online resources in problem solving. We look specifically at how programmers--an exemplar form of knowledge workers--opportunistically interlea...
Joel Brandt, Philip J. Guo, Joel Lewenstein, Mira ...
CIKM
2008
Springer
15 years 7 months ago
Content-based filtering for efficient online materialized view maintenance
Real-time materialized view maintenance has become increasingly popular, especially in real-time data warehousing and data streaming environments. Upon updates to base relations, ...
Gang Luo, Philip S. Yu
FUIN
2006
98views more  FUIN 2006»
15 years 5 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson