Sciweavers

1149 search results - page 161 / 230
» Minimally non-Pfaffian graphs
Sort
View
CLUSTER
2008
IEEE
16 years 19 days ago
Redistribution aware two-step scheduling for mixed-parallel applications
— Applications raising in many scientific fields exhibit both data and task parallelism that have to be exploited efficiently. A classic approach is to structure those applica...
Sascha Hunold, Thomas Rauber, Frédér...
FOCS
2008
IEEE
16 years 19 days ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
16 years 18 days ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
IEEESCC
2008
IEEE
16 years 17 days ago
A Graphical Approach to Providing Infrastructure Recommendations for IT
We present SPIRIT, a Service for Providing Infrastructure Recommendations for Information Technology. SPIRIT allows maintenance support providers for Small-to-Medium Businesses (S...
Ashwin Lall, Anca Sailer, Mark Brodie
INFOCOM
2007
IEEE
16 years 14 days ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...