1356 search results - page 24 / 272 » Some New Results on Inverse Sorting Problems |
177
click to vote
FUIN
2008
15 years 5 months ago
2008
Parsing Expression Grammar (PEG) is a new way to specify syntax, by means of a top-down process with limited backtracking. It can be directly transcribed into a recursive-descent ...
144
click to vote
ICFCA
2007
Springer
16 years 4 days ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...
164
click to vote
IWPEC
2009
Springer
16 years 16 days ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
175
click to vote
EUROCRYPT
2008
Springer
15 years 7 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
174
click to vote
CCE
2004
15 years 5 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...