Sciweavers

13376 search results - page 61 / 2676
» Problem Solving with
Sort
View
IJCAI
1989
15 years 1 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The deĀ­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
15 years 5 months ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan
112
Voted
EAAI
2007
154views more  EAAI 2007»
15 years 21 days ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
128
Voted
ICIP
1997
IEEE
16 years 2 months ago
Using mean field annealing to solve anisotropic diffusion problems
Anisotropic diffusion is a powerful method for image feature extraction in which blurring is allowed to occur except at edges. Mean field annealing (MFA) is an image optimization ...
Hairong Qi, Wesley E. Snyder, Griff L. Bilbro
82
Voted
CGF
2007
82views more  CGF 2007»
15 years 22 days ago
Unpopping: Solving the Image-Space Blend Problem for Smooth Discrete LOD Transitions
This paper presents a new, simple and practical algorithm to avoid artifacts when switching between discrete levels of detail (LOD) by smoothly blending LOD representations in ima...
Markus Giegl, Michael Wimmer