Sciweavers

363 search results - page 20 / 73
» Finding Small Solutions to Small Degree Polynomials
Sort
View
MOBIHOC
2002
ACM
14 years 7 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
IAT
2007
IEEE
14 years 2 months ago
A Distributed Algorithm for Finding Nucleolus-Stable Payoff Divisions
The agents in multiagent systems can coordinate their actions and handle tasks jointly by forming coalitions. One of the important steps in this process is the fair division of pa...
Hrishikesh J. Goradia, José M. Vidal
TSE
2008
148views more  TSE 2008»
13 years 7 months ago
Benchmarking Classification Models for Software Defect Prediction: A Proposed Framework and Novel Findings
Software defect prediction strives to improve software quality and testing efficiency by constructing predictive classification models from code attributes to enable a timely ident...
Stefan Lessmann, Bart Baesens, Christophe Mues, Sw...
OSDI
2004
ACM
14 years 8 months ago
CP-Miner: A Tool for Finding Copy-paste and Related Bugs in Operating System Code
Copy-pasted code is very common in large software because programmers prefer reusing code via copy-paste in order to reduce programming effort. Recent studies show that copy-paste...
Zhenmin Li, Shan Lu, Suvda Myagmar, Yuanyuan Zhou
ISCAS
2007
IEEE
133views Hardware» more  ISCAS 2007»
14 years 1 months ago
Volterra Analysis Using Chebyshev Series
— The paper presents a new approach to the Volterra analysis of analog circuits. This kind of analysis is widely used for the calculation of distortion and intermodulation produc...
Ioannis Sarkas, Dimitrios Mavridis, Michail Papami...