Sciweavers

70 search results - page 10 / 14
» An Undecidable Linear Order That Is n-Decidable for All n
Sort
View
WCNC
2010
IEEE
13 years 11 months ago
Many-To-Many Communications via Space-Time Network Coding
—In this paper, the mutual cooperative communication between multiple nodes in a wireless network is efficiently achieved through a novel concept of Space-Time Network Coding (S...
Mohammed W. Baidas, Hung-Quoc Lai, K. J. Ray Liu
CP
2004
Springer
14 years 1 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
MOBIHOC
2007
ACM
14 years 7 months ago
Capacity of a wireless ad hoc network with infrastructure
In this paper we study the capacity of wireless ad hoc networks with infrastructure support of an overlay of wired base stations. Such a network architecture is often referred to ...
Benyuan Liu, Patrick Thiran, Donald F. Towsley
IPL
2000
111views more  IPL 2000»
13 years 7 months ago
On the performance of the first-fit coloring algorithm on permutation graphs
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
Stavros D. Nikolopoulos, Charis Papadopoulos
CACM
2010
140views more  CACM 2010»
13 years 5 months ago
FastTrack: efficient and precise dynamic race detection
Multithreaded programs are notoriously prone to race conditions. Prior work on dynamic race detectors includes fast but imprecise race detectors that report false alarms, as well ...
Cormac Flanagan, Stephen N. Freund