Sciweavers

16091 search results - page 410 / 3219
» Solving
Sort
View
CP
2005
Springer
16 years 9 days ago
Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
Luca Benini, Davide Bertozzi, Alessio Guerri, Mich...
134
Voted
CP
2005
Springer
16 years 9 days ago
Specialised Constraints for Stable Matching Problems
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
Chris Unsworth, Patrick Prosser
CRYPTO
2005
Springer
104views Cryptology» more  CRYPTO 2005»
16 years 9 days ago
On the Discrete Logarithm Problem on Algebraic Tori
Abstract. Using a recent idea of Gaudry and exploiting rational representations of algebraic tori, we present an index calculus type algorithm for solving the discrete logarithm pr...
Robert Granger, Frederik Vercauteren
DEXA
2005
Springer
109views Database» more  DEXA 2005»
16 years 9 days ago
Formalizing the XML Schema Matching Problem as a Constraint Optimization Problem
The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specifica...
Marko Smiljanic, Maurice van Keulen, Willem Jonker
ECML
2005
Springer
16 years 9 days ago
Machine Learning of Plan Robustness Knowledge About Instances
Abstract. Classical planning domain representations assume all the objects from one type are exactly the same. But when solving problems in the real world systems, the execution of...
Sergio Jiménez, Fernando Fernández, ...