Sciweavers

3913 search results - page 89 / 783
» complexity 2006
Sort
View
FUIN
2007
134views more  FUIN 2007»
13 years 10 months ago
Complexity Issues in Multiagent Logics
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...
EJC
2006
13 years 10 months ago
The positive Bergman complex of an oriented matroid
We study the positive Bergman complex B+ (M) of an oriented matroid M, which is a certain subcomplex of the Bergman complex B(M) of the underlying unoriented matroid M. The positiv...
Federico Ardila, Caroline J. Klivans, Lauren Willi...
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
14 years 10 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
JSA
2006
60views more  JSA 2006»
13 years 10 months ago
A schema version model for complex objects in object-oriented databases
In this paper, we propose a schema version model which allows to restructure complex object hierarchy in object-oriented databases. This model extends a schema version model, call...
Sang-Won Lee, Jung-Ho Ahn, Hyoung-Joo Kim
JSAC
2006
157views more  JSAC 2006»
13 years 10 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas