Sciweavers

3142 search results - page 471 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
IPPS
2002
IEEE
15 years 5 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
FLAIRS
2008
15 years 2 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
84
Voted
ENTCS
2008
115views more  ENTCS 2008»
15 years 13 days ago
Time Separation of Events: An Inverse Method
The problem of "time separation" can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, ...
Emmanuelle Encrenaz, Laurent Fribourg
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 7 months ago
Soft memory for stock market analysis using linear and developmental genetic programming
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
Garnett Carl Wilson, Wolfgang Banzhaf
89
Voted
SI3D
2006
ACM
15 years 6 months ago
View-dependent precomputed light transport using nonlinear Gaussian function approximations
We propose a real-time method for rendering rigid objects with complex view-dependent effects under distant all-frequency lighting. Existing precomputed light transport approaches...
Paul Green, Jan Kautz, Wojciech Matusik, Fré...