Sciweavers

3218 search results - page 370 / 644
» Timed Extensions for SDL
Sort
View
KR
2004
Springer
15 years 12 months ago
Planning Graphs and Knowledge Compilation
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
Hector Geffner
INFOCOM
2002
IEEE
15 years 11 months ago
Avoiding Instability during Graceful Shutdown of OSPF
Abstract—Many recent router architectures decouple the routing engine from the forwarding engine, so that packet forwarding can continue even when the routing process is not acti...
Aman Shaikh, Rohit Dube, Anujan Varma
KBSE
2002
IEEE
15 years 11 months ago
Report on the Workshop on the State of the Art in Automated Software Engineering
ort gives their abstracts. s of the position papers Recent Experiences with Code Generation and Task Automation Agents in Software Tools (J. Grundy, J. Hosking) As software grows i...
Yves Ledru, David F. Redmiles
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 11 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
MOBIDE
1999
ACM
15 years 11 months ago
Pervasive Computing: What is it Good for?
The first mass-produced pervasive computing devices are starting to appear—the AutoPC, the Internet-connected ScreenFridge, and the combination Microwave Oven/Home Banking term...
Andrew C. Huang, Benjamin C. Ling, Shankar Ponneka...