Sciweavers

1792 search results - page 355 / 359
» Improved scheduling in rings
Sort
View
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
13 years 7 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
TKDE
2002
112views more  TKDE 2002»
13 years 7 months ago
Multiversion Locking Protocol with Freezing for Secure Real-Time Database Systems
Database systems for real-time applications must satisfy timing constraints associated with transactions. Typically, a timing constraint is expressed in the form of a deadline and ...
Chanjung Park, Seog Park, Sang Hyuk Son
NETWORK
2007
187views more  NETWORK 2007»
13 years 6 months ago
Cooperative and opportunistic transmission for wireless ad hoc networks
Moving toward 4G, wireless ad hoc networks receive growing interest due to users’ provisioning of mobility, usability of services, and seamless communications. In ad hoc network...
Qian Zhang, Qing Chen, Fan Yang, Xuemin Shen, Zhis...
INFOCOM
2010
IEEE
13 years 5 months ago
Opportunistic Routing in Multi-radio Multi-channel Multi-hop Wireless Networks
— Two major factors that limit the throughput in multi-hop wireless networks are the unreliability of wireless transmissions and co-channel interference. One promising technique ...
Kai Zeng, Zhenyu Yang, Wenjing Lou
PC
2010
196views Management» more  PC 2010»
13 years 5 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak