Sciweavers

127 search results - page 14 / 26
» Locally Thin Set Families
Sort
View
LPAR
2001
Springer
14 years 1 days ago
Local Conditional High-Level Robot Programs
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
Sebastian Sardiña
CSB
2004
IEEE
13 years 11 months ago
MISAE: A New Approach for Regulatory Motif Extraction
The recognition of regulatory motifs of co-regulated genes is essential for understanding the regulatory mechanisms. However, the automatic extraction of regulatory motifs from a ...
Zhaohui Sun, Jingyi Yang, Jitender S. Deogun
AAAI
2004
13 years 9 months ago
Methods for Boosting Revenue in Combinatorial Auctions
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
Anton Likhodedov, Tuomas Sandholm
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
14 years 1 months ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
COMPGEOM
2004
ACM
14 years 1 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky