1568 search results - page 166 / 314 » The problem of examination questions in algorithmics |
152
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
176
click to vote
ICCVW
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
149
click to vote
ATAL
2007
Springer
16 years 17 days ago
2007
Springer
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
161
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
173
click to vote
CPM
2004
Springer
15 years 10 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...