Sciweavers

887 search results - page 101 / 178
» Locally definable homotopy
Sort
View
VLDB
1998
ACM
91views Database» more  VLDB 1998»
13 years 12 months ago
Determining Text Databases to Search in the Internet
Text data in the Internet can be partitioned into many databases naturally. Efficient retrieval of desired data can be achieved if we can accurately predict the usefulness of each...
Weiyi Meng, King-Lup Liu, Clement T. Yu, Xiaodong ...
ICS
2010
Tsinghua U.
13 years 12 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
DIMVA
2009
13 years 8 months ago
A Service Dependency Modeling Framework for Policy-Based Response Enforcement
The use of dynamic access control policies for threat response adapts local response decisions to high level system constraints. However, security policies are often carefully tigh...
Nizar Kheir, Hervé Debar, Fréd&eacut...
BMCBI
2007
176views more  BMCBI 2007»
13 years 7 months ago
The Firegoose: two-way integration of diverse data from different bioinformatics web resources with desktop applications
Background: Information resources on the World Wide Web play an indispensable role in modern biology. But integrating data from multiple sources is often encumbered by the need to...
J. Christopher Bare, Paul T. Shannon, Amy K. Schmi...
JSAT
2008
122views more  JSAT 2008»
13 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya