Sciweavers

6167 search results - page 885 / 1234
» Can Refinement be Automated
Sort
View
CHI
2011
ACM
14 years 8 months ago
Characterizing the usability of interactive applications through query log analysis
People routinely rely on Internet search engines to support their use of interactive systems: they issue queries to learn how to accomplish tasks, troubleshoot problems, and other...
Adam Fourney, Richard Mann, Michael Terry
FORTE
2011
14 years 8 months ago
Analyzing BGP Instances in Maude
Analyzing Border Gateway Protocol (BGP) instances is a crucial step in the design and implementation of safe BGP systems. Today, the analysis is a manual and tedious process. Resea...
Anduo Wang, Carolyn L. Talcott, Limin Jia, Boon Th...
IS
2012
14 years 16 days ago
On the refactoring of activity labels in business process models
Large corporations increasingly utilize business process models for documenting and redesigning their operations. The extent of such modeling initiatives with several hundred mode...
Henrik Leopold, Sergey Smirnov 0002, Jan Mendling
BMCBI
2006
184views more  BMCBI 2006»
15 years 5 months ago
PubFocus: semantic MEDLINE/PubMed citations analytics through integration of controlled biomedical dictionaries and ranking algo
Background: Understanding research activity within any given biomedical field is important. Search outputs generated by MEDLINE/PubMed are not well classified and require lengthy ...
Maksim V. Plikus, Zina Zhang, Cheng-Ming Chuong
CSL
2007
Springer
15 years 11 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann