Sciweavers

2191 search results - page 27 / 439
» Improving the Efficiency of Non-Deterministic Computations
Sort
View
CAISE
2005
Springer
14 years 1 months ago
Computing the Relevant Instances That May Violate an OCL Constraint
Integrity checking is aimed at efficiently determining whether the state of the information base is consistent after the application of a set of structural events. One possible way...
Jordi Cabot, Ernest Teniente
ACG
2006
Springer
13 years 11 months ago
Enhancing Search Efficiency by Using Move Categorization Based on Game Progress in Amazons
Amazons is a two-player perfect information game with a high branching factor, particularly in the opening. Therefore, improving the efficiency of the search is important for impro...
Yoshinori Higashiuchi, Reijer Grimbergen
DEXAW
2009
IEEE
141views Database» more  DEXAW 2009»
13 years 8 months ago
Improving Practical Performance on Secure and Private Collaborative Linear Programming
Although information sharing in supply chain management dramatically reduces costs, parties are reluctant to do so, mainly due to fear of information leakage. Solutions based on se...
Rafael Deitos, Florian Kerschbaum
DATE
2002
IEEE
102views Hardware» more  DATE 2002»
14 years 22 days ago
Improving Placement under the Constant Delay Model
In this paper, we show that under the constant delay model the placement problem is equivalent to minimizing a weighted sum of wire lengths. The weights can be efficiently compute...
Kolja Sulimma, Wolfgang Kunz, Ingmar Neumann, Luka...
NECO
2008
112views more  NECO 2008»
13 years 7 months ago
Second-Order SMO Improves SVM Online and Active Learning
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
Tobias Glasmachers, Christian Igel