562 search results - page 15 / 113 » Dependency Pairs Revisited |
121
click to vote
BIRTHDAY
2008
Springer
15 years 3 months ago
2008
Springer
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...
124
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
112
click to vote
COMPGEOM
1995
ACM
15 years 5 months ago
1995
ACM
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
142
click to vote
EOR
2008
15 years 1 months ago
2008
We present a new method, called UTAGMS , for multiple criteria ranking of alternatives from set A using a set of additive value functions which result from an ordinal regression. ...
119
click to vote
JOT
2008
15 years 1 months ago
2008
Class cohesion is considered as one of most important object-oriented software attributes. Cohesion refers to the degree of relatedness between members in a class. High cohesion i...