5263 search results - page 765 / 1053 » Open Constraint Optimization |
236
click to vote
GECCO
2004
Springer
16 years 19 days ago
2004
Springer
Inspired by the efficient method of locomotion of the rattlesnake Crotalus cerastes, the objective of this work is automatic design through genetic programming, of the fastest poss...
179
click to vote
IMR
2004
Springer
16 years 19 days ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
174
click to vote
WEBI
2004
Springer
16 years 18 days ago
2004
Springer
In order to achieve optimal efficiency in a learning process, individual learner needs his/her own personalized assistance. For a web-based open and dynamic learning environment, ...
142
click to vote
FOCS
2003
IEEE
16 years 16 days ago
2003
IEEE
Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
163
click to vote
ICSM
2003
IEEE
16 years 16 days ago
2003
IEEE
Moving to smaller libraries can be considered as a relevant task when porting software systems to limited-resource devices (e.g., hand-helds). Library miniaturization will be part...