Sciweavers

488 search results - page 2 / 98
» Simulating Context Effects in Problem Solving with AMBR
Sort
View
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
13 years 4 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
SUTC
2006
IEEE
14 years 1 months ago
Self-organization Strategies for Dynamic Context Coverage in Capability-Constrained Mobile Sensor Networks
We propose and formally characterize a new problem named the dynamic context coverage problem in capabilityconstrained mobile sensor network environments. The goal is to move and ...
Shiow-yang Wu, Chao-Hong Liu, Chen-Kuang Tzeng
AAAI
1996
13 years 8 months ago
Nearly Monotonic Problems: A Key to Effective FA/C Distributed Sensor Interpretation?
The fesractioncslly-Qcczdrrcate, cooperative (FA/C) distributed problem-solving paradigm is one approach for organizing distributed problem solving among homogeneous, cooperating ...
Norman Carver, Victor R. Lesser, Robert Whitehair
EMO
2009
Springer
190views Optimization» more  EMO 2009»
14 years 2 months ago
Solving Bilevel Multi-Objective Optimization Problems Using Evolutionary Algorithms
Abstract. Bilevel optimization problems require every feasible upperlevel solution to satisfy optimality of a lower-level optimization problem. These problems commonly appear in ma...
Kalyanmoy Deb, Ankur Sinha
COR
2008
88views more  COR 2008»
13 years 7 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...