Sciweavers

633 search results - page 15 / 127
» Locality and Hard SAT-Instances
Sort
View
KR
2004
Springer
14 years 24 days ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
ICVGIP
2004
13 years 8 months ago
Local Correlation-based Fingerprint Matching
Most fingerprint matching systems are based on matching minutia points between two fingerprint images. Each minutia is represented by a fixed number of attributes such as the loca...
Karthik Nandakumar, Anil K. Jain
ITC
1996
IEEE
78views Hardware» more  ITC 1996»
13 years 11 months ago
Realistic-Faults Mapping Scheme for the Fault Simulation of Integrated Analogue CMOS Circuits
common use is the distinction into two (abstract) fault models: A new fault modelling scheme for integrated analogue general the "Single Hard Fault Model (SHFM)" and the ...
Michael J. Ohletz
ATAL
2001
Springer
13 years 12 months ago
Evolving Real-Time Local Agent Control for Large-Scale Multi-agent Systems
Abstract. Control for agents situated in multi-agent systems is a complex problem. This is particularly true in hard, open, dynamic environments where resource, privacy, bandwidth,...
Thomas Wagner, Victor R. Lesser
MOBIHOC
2006
ACM
14 years 7 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...