1568 search results - page 51 / 314 » The problem of examination questions in algorithmics |
62
Voted
TPHOL
2003
IEEE
15 years 3 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
ECAI
2008
Springer
14 years 12 months ago
2008
Springer
This paper addresses the multi-agent patrolling problem, which consists for a set of autonomous agents to visit all the places of an unknown environment as regularly as possible. T...
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract— As the multicast-capable part of the Internet continues to evolve, important questions to ask are whether the protocols are operating correctly, the topology is well co...
87
Voted
RECOMB
2010
Springer
15 years 5 months ago
2010
Springer
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
CASC
2010
Springer
14 years 9 months ago
2010
Springer
Convexity is an important property in nonlinear optimization since it allows to apply efficient local methods for finding global solutions. We propose to apply symbolic methods t...