8486 search results - page 131 / 1698 » Ordered Enumeration Method |
139
Voted
ENTCS
2006
15 years 2 months ago
2006
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
123
Voted
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
121
Voted
APLAS
2006
ACM
15 years 8 months ago
2006
ACM
This paper tackles a problem often overlooked in functional programming community: that of testing. Fully automatic test tools like Quickcheck and G∀ST can test first order func...
132
Voted
BMVC
2010
15 years 24 days ago
2010
High order features have been proposed to incorporate geometrical information into the "bag of feature" representation. We propose algorithms to perform fast weakly supe...
236
Voted
ICDE
2009
IEEE
16 years 4 months ago
2009
IEEE
The vast majority of work on skyline queries considers totally ordered domains, whereas in many applications some attributes are partially ordered, as for instance, domains of set ...