16504 search results - page 368 / 3301 » New Problems, New Solutions |
182
click to vote
ACL
2010
15 years 4 months ago
2010
This paper presents a general-purpose open source package for recognizing Textual Entailment. The system implements a collection of algorithms, providing a configurable framework ...
190
click to vote
TASE
2010
IEEE
15 years 1 months ago
2010
IEEE
Group elevator scheduling has received considerable attention due to its importance to transportation efficiency for mid-rise and high-rise buildings. One important trend to improv...
164
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In their seminal paper in the ACM Transactions on Software Engineering and Methodology, Zave and Jackson established a core ontology for Requirements Engineering (RE) and used it ...
158
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
227
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...