Sciweavers

1264 search results - page 126 / 253
» The framework approach for constraint satisfaction
Sort
View
ICML
2007
IEEE
16 years 7 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner
SBACPAD
2007
IEEE
85views Hardware» more  SBACPAD 2007»
16 years 21 days ago
Exigency-based real-time scheduling policy to provide absolute QoS for web services
— Telemedicine, distance learning and e-commerce applications impose time constraints directly related to the efficacy of their operations. In order to offer reliability levels ...
Lucas S. Casagrande, Rodrigo Fernandes de Mello, R...
AMEC
2004
Springer
15 years 11 months ago
iAuctionMaker: A Decision Support Tool for Mixed Bundling
This paper presents iAuctionMaker as a novel tool that serves as a decision support for e-sourcing professionals on their pursuing of auction optimisation. Given a set of items to ...
Antonio Reyes-Moro, Juan A. Rodríguez-Aguil...
SAC
2003
ACM
15 years 11 months ago
reality: a Scalable Intelligent Travel Planner
Many information systems are used in a problem solving context. Examples are travel planning systems, catalogs in electronic commerce, or agenda planning systems. They can be made...
Marc Torrens, Patrick Hertzog, Loic Samson, Boi Fa...
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
15 years 10 months ago
OPTIMISTA: state minimization of asynchronous FSMs for optimum output logic
The optimal state minimization problem is to select a reduced state machine having the best logic implementation over all possible state reductions and encodings. A recent algorit...
Robert M. Fuhrer, Steven M. Nowick