Sciweavers

1176 search results - page 109 / 236
» Implicit Abstraction Heuristics
Sort
View
AIR
2004
130views more  AIR 2004»
15 years 16 days ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
JCO
1998
136views more  JCO 1998»
15 years 9 days ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
76
Voted
TROB
2002
117views more  TROB 2002»
15 years 8 days ago
Concurrent metamorphosis of hexagonal robot chains into simple connected configurations
Abstract-- The problem addressed is the distributed reconfiguration of a metamorphic robotic system composed of an arbitrary number of two dimensional hexagonal robots (modules) fr...
Jennifer E. Walter, Jennifer L. Welch, Nancy M. Am...
113
Voted
JSAC
2010
194views more  JSAC 2010»
14 years 11 months ago
Burst communication by means of buffer allocation in body sensor networks: Exploiting signal processing to reduce the number of
Abstract—Monitoring human movements using wireless sensory devices promises to revolutionize the delivery of healthcare services. Such platforms use inertial information of their...
Hassan Ghasemzadeh, Vitali Loseu, Sarah Ostadabbas...
SUTC
2010
IEEE
14 years 11 months ago
Resource-Aware Scheduling of Distributed Ontological Reasoning Tasks in Wireless Sensor Networks
Abstract—As the number of wireless sensor network applications continues to grow, the need for specialized task scheduling mechanisms, aware of the sensor devices’ capabilities...
Tim De Pauw, Stijn Verstichel, Bruno Volckaert, Fi...