9842 search results - page 410 / 1969 » The Complexity of the Matching-Cut Problem |
114
click to vote
AIIA
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. The O-OSCAR software architecture is a problem solving environment for complex scheduling problem that is based on a constraintbased representation. On top of this core r...
145
click to vote
RTCSA
1999
IEEE
15 years 8 months ago
1999
IEEE
The lifecycle for industrial applications are becoming shorter, the application complexity increases, performance is to low, fault tolerance is required, reuse of components is de...
136
click to vote
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
140
Voted
WDAG
1998
Springer
15 years 8 months ago
1998
Springer
The paper addresses the problemof solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader El...
132
click to vote
EH
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper discusses the problem of increased programming time for intrinsic evolvable hardware (EHW) as the complexity of the circuit grows. We develop equations for the size of ...