Sciweavers

2125 search results - page 325 / 425
» On Graph Complexity
Sort
View
ECCC
2006
145views more  ECCC 2006»
13 years 10 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
JAIR
2006
90views more  JAIR 2006»
13 years 10 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
CSUR
1999
159views more  CSUR 1999»
13 years 9 months ago
Hubs, authorities, and communities
The Web can be naturally modeled as a directed graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerab...
Jon M. Kleinberg
VLDB
2002
ACM
264views Database» more  VLDB 2002»
13 years 9 months ago
Viator - A Tool Family for Graphical Networking and Data View Creation
Web-based data sources, particularly in Life Sciences, grow in diversity and volume. Most of the data collections are equipped with common document search, hyperlink and retrieval...
Stephan Heymann, Katja Tham, Axel Kilian, Gunnar W...
VEE
2012
ACM
255views Virtualization» more  VEE 2012»
12 years 5 months ago
Adding dynamically-typed language support to a statically-typed language compiler: performance evaluation, analysis, and tradeof
Applications written in dynamically typed scripting languages are increasingly popular for Web software development. Even on the server side, programmers are using dynamically typ...
Kazuaki Ishizaki, Takeshi Ogasawara, José G...