9842 search results - page 412 / 1969 » The Complexity of the Matching-Cut Problem |
126
Voted
FORTE
2008
15 years 6 months ago
2008
Designing and interoperability testing of distributed, application-level network protocols is complex. Windows, for example, supports currently more than 200 protocols, ranging fro...
139
click to vote
PDPTA
2008
15 years 6 months ago
2008
Solving linear systems with a large number of variables is at the core of many scienti c problems. Parallel processing techniques for solving such systems have received much attent...
174
click to vote
AAAI
2004
15 years 6 months ago
2004
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...
155
click to vote
DLOG
2001
15 years 6 months ago
2001
We consider expressive Description Logics (ALCN) allowing for number restrictions on complex roles built with combinations of role constructors. In particular, we are mainly inter...
150
click to vote
ALC
1997
15 years 6 months ago
1997
In the context of the modular and incremental development of complex systems, viewed as interconnections of interacting components, new dimensions and new problems arise in the ca...