Sciweavers

3250 search results - page 506 / 650
» An Algorithm to Solve a Linear Program
Sort
View
MFCS
2009
Springer
16 years 27 days ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
XIMEP
2006
ACM
179views Database» more  XIMEP 2006»
16 years 9 days ago
Positional Grouping in XQuery
This paper proposes an extension to the XQuery language to solve the problem of positional grouping: that is, problems in which it is necessary to convert a flat sequence into a h...
Michael H. Kay
CCS
2005
ACM
15 years 12 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
GECCO
2005
Springer
15 years 12 months ago
A new approach to evaluate GP schema in context
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
Hammad Majeed
GECCO
2005
Springer
103views Optimization» more  GECCO 2005»
15 years 12 months ago
Pricing the 'free lunch' of meta-evolution
A number of recent studies introduced meta-evolutionary strategies and successfully used them for solving problems in genetic programming. While individual results indicate possib...
Alexei V. Samsonovich, Kenneth A. De Jong