4218 search results - page 267 / 844 » Complete sets of cooperations |
COCO
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
ICWE
2007
Springer
15 years 7 months ago
2007
Springer
Combining expressiveness and plainness in the design of web documents is a difficult task. Validation languages are very powerful and designers are tempted to over-design specific...
77
Voted
IFIP
2007
Springer
15 years 7 months ago
2007
Springer
The shift of development effort onto the model level, as postulated by MDA, provides an opportunity for establishing a set of modelling constructs that is more intuitive and homoge...
152
Voted
JSAI
2007
Springer
15 years 7 months ago
2007
Springer
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically expl...
SARA
2007
Springer
15 years 7 months ago
2007
Springer
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...