Sciweavers

2634 search results - page 96 / 527
» Faster Than Uppaal
Sort
View
ACL
2000
13 years 10 months ago
An Improved Parser for Data-Oriented Lexical-Functional Analysis
We present an LFG-DOP parser which uses fragments from LFG-annotated sentences to parse new sentences. Experiments with the Verbmobil and Homecentre corpora show that (1) Viterbi ...
Rens Bod
SODA
2000
ACM
102views Algorithms» more  SODA 2000»
13 years 10 months ago
Escaping a grid by edge-disjoint paths
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting
GECCO
2010
Springer
225views Optimization» more  GECCO 2010»
13 years 9 months ago
Comparison of NEWUOA with different numbers of interpolation points on the BBOB noiseless testbed
In this paper, we study the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) with different numbers of interpolation points. NEWUOA is a trust region method, ...
Raymond Ros
DAM
2006
89views more  DAM 2006»
13 years 9 months ago
First vs. best improvement: An empirical study
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than selecting the first impr...
Pierre Hansen, Nenad Mladenovic
IJNSEC
2006
132views more  IJNSEC 2006»
13 years 9 months ago
A Fast Semantically Secure Public Key Cryptosystem Based on Factoring
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent a...
Sahadeo Padhye, Birendra Kumar Sharma