Sciweavers

8067 search results - page 97 / 1614
» A Model Proposal of the Interoperability Problem
Sort
View
UML
2005
Springer
15 years 8 months ago
Representing and Applying Design Patterns: What Is the Problem?
Design patterns embody proven solutions to recurring design problems. Ever since the gang of four popularized the concept, researchers have been trying to develop methods for repre...
Hafedh Mili, Ghizlane El-Boussaidi
WSC
2008
15 years 5 months ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese
105
Voted
GLVLSI
2005
IEEE
85views VLSI» more  GLVLSI 2005»
15 years 9 months ago
Utilizing don't care states in SAT-based bounded sequential problems
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
Sean Safarpour, Görschwin Fey, Andreas G. Ven...
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 7 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber
ASIACRYPT
2008
Springer
15 years 5 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...