2016 search results - page 245 / 404 » Megamaps: Construction and Examples |
218
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. ...
148
click to vote
OOPSLA
2009
Springer
16 years 1 months ago
2009
Springer
Multiple inheritance has long been plagued with the “diamond” inheritance problem, leading to solutions that restrict expressiveness, such as mixins and traits. Instead, we ad...
194
click to vote
IJCNN
2008
IEEE
16 years 1 months ago
2008
IEEE
— We consider a fully complex-valued radial basis function (RBF) network for regression application. The locally regularised orthogonal least squares (LROLS) algorithm with the D...
170
click to vote
KBSE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—We describe BPELCheck, a tool for statically analyzing interactions of composite web services implemented in BPEL. Our algorithm is compositional, and checks each proces...
151
click to vote
APSEC
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents a model-based approach to requirements engineering for reactive systems; we use an elevator controller as case study. We identify and justify two key propertie...