Sciweavers

2300 search results - page 440 / 460
» Maximally Concurrent Programs
Sort
View
118
Voted
TWC
2008
113views more  TWC 2008»
15 years 12 days ago
Capacity of opportunistic routing in multi-rate and multi-hop wireless networks
Abstract-- Opportunistic routing (OR) copes with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and spatial diversity of the multi-hop wirel...
Kai Zeng, Wenjing Lou, Hongqiang Zhai
CORR
2004
Springer
208views Education» more  CORR 2004»
15 years 11 days ago
Business Intelligence from Web Usage Mining
The rapid e-commerce growth has made both business community and customers face a new situation. Due to intense competition on the one hand and the customer's option to choose...
Ajith Abraham
AI
1998
Springer
15 years 7 days ago
Remote Agent: To Boldly Go Where No AI System Has Gone Before
Renewed motives for space exploration have inspired NASA to work toward the goal of establishing a virtual presence in space, through heterogeneous eets of robotic explorers. Info...
Nicola Muscettola, P. Pandurang Nayak, Barney Pell...
CACM
1998
103views more  CACM 1998»
15 years 7 days ago
The Virtual Design Team
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
John C. Kunz, Tore R. Christiansen, Geoff P. Cohen...
139
Voted
LOGCOM
1998
178views more  LOGCOM 1998»
15 years 5 days ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh