Sciweavers

1940 search results - page 357 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 12 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
CGF
2007
145views more  CGF 2007»
14 years 11 months ago
Bitmask Soft Shadows
Recently, several real-time soft shadow algorithms have been introduced which all compute a single shadow map and use its texels to obtain a discrete scene representation. The res...
Michael Schwarz, Marc Stamminger
IJON
2006
131views more  IJON 2006»
14 years 11 months ago
Optimizing blind source separation with guided genetic algorithms
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
J. M. Górriz, Carlos García Puntonet...
CORR
2007
Springer
83views Education» more  CORR 2007»
14 years 11 months ago
Simulation of Phase Combinations in Shape Memory Alloys Patches by Hybrid Optimization Methods
In this paper, phase combinations among martensitic variants in shape memory alloys patches and bars are simulated by a hybrid optimization methodology. The mathematical model is ...
Linxiang X. Wang, Roderick V. N. Melnik
JMLR
2006
117views more  JMLR 2006»
14 years 11 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon