Sciweavers

1208 search results - page 166 / 242
» On Counting Generalized Colorings
Sort
View
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 10 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 4 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
GLOBECOM
2008
IEEE
14 years 4 months ago
Multi-Cluster Multi-Parent Wake-Up Scheduling in Delay-Sensitive Wireless Sensor Networks
—Immediate notification of urgent but rare events and delivery of time sensitive actuation commands appear in many practical wireless sensor and actuator network applications. M...
Huang Lee, Abtin Keshavarzian, Hamid K. Aghajan
ICYCS
2008
IEEE
14 years 4 months ago
FAST CASH: FAir and STable Channel ASsignment on Heterogeneous Wireless Mesh Network
— Nowadays wireless mesh routers are facilitating with more wireless channels than ever because of the advanced wireless communication technologies such as OFDM, SDR and CR(cogni...
Panlong Yang, Guihai Chen
IROS
2007
IEEE
127views Robotics» more  IROS 2007»
14 years 4 months ago
Goal directed navigation with uncertainty in adversary locations
— This paper addresses the problem of planning for goal directed navigation in the environment that contains a number of possible adversary locations. It first shows that common...
Maxim Likhachev, Anthony Stentz