Sciweavers

1144 search results - page 2 / 229
» Fractal Algorithm for Finding Global Optimal Solution
Sort
View
EACL
2009
ACL Anthology
13 years 3 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud
JC
2002
63views more  JC 2002»
13 years 5 months ago
On the Complexity of Exclusion Algorithms for Optimization
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a fun...
Eugene L. Allgower, Melissa Erdmann, Kurt Georg
SAC
1996
ACM
13 years 9 months ago
A genetic algorithm for the minimum broadcast time problem using a global precedence vector
The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is k...
Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wa...
ICIP
2000
IEEE
14 years 6 months ago
Fast Code Enhancement with Local Search for Fractal Image Compression
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
Raouf Hamzaoui, Dietmar Saupe, Michael Hiller
WECWIS
2002
IEEE
130views ECommerce» more  WECWIS 2002»
13 years 10 months ago
A New Category of Business Negotiation Primitives for Bilateral Negotiation Agents and Associated Algorithm to Find Pareto Optim
How to conduct automated business negotiation over the Internet is an important issue for agent research. In most bilateral negotiation models, two negotiation agents negotiate by...
Haifei Li