Sciweavers

1264 search results - page 77 / 253
» The framework approach for constraint satisfaction
Sort
View
CCIA
2005
Springer
15 years 11 months ago
A Preliminary Study on the Relaxation of Numeric Features in Planning
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that div...
Antonio Garrido, Eva Onaindia, Donato Herná...
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
15 years 11 months ago
Lagrange Multiplier Method for Multi-campaign Assignment Problem
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
Yong-Hyuk Kim, Byung Ro Moon
CSMR
1998
IEEE
15 years 10 months ago
Assessing Architectural Complexity
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
Rick Kazman, M. Burth
TWC
2008
105views more  TWC 2008»
15 years 6 months ago
Joint medium access control, routing and energy distribution in multi-hop wireless networks
It is a challenging task for multi-hop wireless networks to support multimedia applications with quality-ofservice (QoS) requirements. This letter presents a joint crosslayer optim...
Khoa T. Phan, Hai Jiang, Chintha Tellambura, Sergi...
ECAI
2000
Springer
15 years 10 months ago
Incremental Forward Checking for the Disjunctive Temporal Problem
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Angelo Oddi, Amedeo Cesta