3404 search results - page 444 / 681 » C Programming Tutorial |
121
click to vote
ORL
1998
15 years 1 months ago
1998
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
104
Voted
SIAMJO
2002
15 years 1 months ago
2002
The paper deals with the calmness of a class of multifunctions in finite dimensions. Its first part is devoted to various conditions for calmness, which are derived in terms of cod...
132
Voted
VLC
2002
15 years 1 months ago
2002
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
131
click to vote
FUIN
2008
15 years 1 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 ...
RV
2010
Springer
15 years 19 days ago
2010
Springer
Abstract. We address the problem of runtime monitoring for hard realtime programs—a domain in which correctness is critical yet has largely been overlooked in the runtime monitor...