9842 search results - page 325 / 1969 » The Complexity of the Matching-Cut Problem |
115
Voted
ICSE
2003
IEEE-ACM
16 years 4 months ago
2003
IEEE-ACM
Frameworks such as J2EE are designed to simplify the process of developing enterprise applications by handling much of the complexity of concurrency, transaction, and persistence ...
138
Voted
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
— The dynamic composition of systems of networked appliances, or virtual devices, enables users to generate complex strong specific systems. Current prominent MANET-based composi...
125
click to vote
ISSAC
2004
Springer
15 years 9 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
140
click to vote
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
118
click to vote
TON
2002
15 years 3 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...