Sciweavers

562 search results - page 15 / 113
» Dependency Pairs Revisited
Sort
View
BIRTHDAY
2008
Springer
13 years 9 months ago
History Dependent Automata for Service Compatibility
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...
Vincenzo Ciancia, Gian Luigi Ferrari, Marco Pistor...
INFOCOM
2005
IEEE
14 years 1 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— 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 ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
COMPGEOM
1995
ACM
13 years 11 months ago
The Rectangle Enclosure and Point-Dominance Problems Revisited
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...
Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid...
EOR
2008
99views more  EOR 2008»
13 years 7 months ago
Ordinal regression revisited: Multiple criteria ranking using a set of additive value functions
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. ...
Salvatore Greco, Vincent Mousseau, Roman Slowinski
JOT
2008
119views more  JOT 2008»
13 years 7 months ago
Revisiting Class Cohesion: An empirical investigation on several systems
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...
Linda Badri, Mourad Badri, Alioune Badara Gueye