Sciweavers

972 search results - page 189 / 195
» Reasoning with Conditional Time-Intervals
Sort
View
JSAC
2007
78views more  JSAC 2007»
13 years 7 months ago
Partially Optimal Routing
— Most large-scale communication networks, such as the Internet, consist of interconnected administrative domains. While source (or selfish) routing, where transmission follows ...
Daron Acemoglu, Ramesh Johari, Asuman E. Ozdaglar
SIGMETRICS
2000
ACM
217views Hardware» more  SIGMETRICS 2000»
13 years 7 months ago
Experimenting with an Ad Hoc wireless network on campus: insights and experiences
Ad hoc wireless networks are new communication networks that can be dynamically formed and deformed onthe- y, anytime and anywhere. User data is routed with the help of an ad hoc ...
Chai-Keong Toh, Richard Chen, Minar Delwar, Donald...
DKE
1998
88views more  DKE 1998»
13 years 7 months ago
Temporal Grid File: A File Structure for Interval Data
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
Chiang Lee, Te-Ming Tseng
MP
2002
165views more  MP 2002»
13 years 7 months ago
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
Defeng Sun, Robert S. Womersley, Houduo Qi
LOGCOM
1998
80views more  LOGCOM 1998»
13 years 7 months ago
Occurrences and Narratives as Constraints in the Branching Structure of the Situation Calculus
The Situation Calculus is a logic of time and change in which there is a distinguished initial situation ¡£¢ and all other situations arise from the different sequences of acti...
Javier Pinto