Sciweavers

16257 search results - page 297 / 3252
» D-finiteness: algorithms and applications
Sort
View
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
15 years 10 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
196
Voted
AICT
2005
IEEE
194views Communications» more  AICT 2005»
16 years 9 days ago
Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
Claus Bauer
CP
2011
Springer
14 years 6 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
SPAA
2003
ACM
15 years 12 months ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd
AAAI
2006
15 years 8 months ago
A Direct Evolutionary Feature Extraction Algorithm for Classifying High Dimensional Data
Among various feature extraction algorithms, those based on genetic algorithms are promising owing to their potential parallelizability and possible applications in large scale an...
Qijun Zhao, David Zhang, Hongtao Lu