1477 search results - page 81 / 296 » Complexity of (iterated) dominance |
163
click to vote
ICTAI
1999
IEEE
15 years 10 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
139
click to vote
ALIFE
2008
15 years 6 months ago
2008
There is an ongoing debate as to whether the words in early pre-syntactic forms of human language had simple atomic meanings like modern words [4, 5], or whether they were holophr...
186
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
292
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
165
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...