Sciweavers

3690 search results - page 738 / 738
» Computation with classical sequents
Sort
View
ANCS
2009
ACM
13 years 4 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
SIAMMA
2011
97views more  SIAMMA 2011»
12 years 9 months ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...
GECCO
1999
Springer
111views Optimization» more  GECCO 1999»
13 years 11 months ago
Evolving a behavior-based control architecture- From simulations to the real world
Genetic programming makes it possible to automatically search the space of possible programs. First we evolved a behavior-based control architecture using computer simulations. Th...
Marc Ebner, Andreas Zell
COMGEO
2011
ACM
13 years 1 months ago
Improved bounds for cops-and-robber pursuit
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
Laurent Alonso, Edward M. Reingold
GECCO
2003
Springer
201views Optimization» more  GECCO 2003»
14 years 2 days ago
Solving Mastermind Using Genetic Algorithms
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
Tom Kalisker, Doug Camens