Sciweavers

1931 search results - page 371 / 387
» Why we blog
Sort
View
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
15 years 6 months ago
On-Line File Caching
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...
Neal E. Young
ACL
1994
15 years 6 months ago
Discourse Obligations in Dialogue Processing
We show that in modeling social interaction, particularly dialogue, the attitude of obligation can be a useful adjunct to the popularly considered attitudes of belief, goal, and i...
David R. Traum, James F. Allen
BMCBI
2010
133views more  BMCBI 2010»
15 years 5 months ago
Integrated prediction of one-dimensional structural features and their relationships with conformational flexibility in helical
Background: Many structural properties such as solvent accessibility, dihedral angles and helix-helix contacts can be assigned to each residue in a membrane protein. Independent s...
Shandar Ahmad, Yumlembam Hemjit Singh, Yogesh Paud...
BMCBI
2007
110views more  BMCBI 2007»
15 years 5 months ago
Analysis of feedback loops and robustness in network evolution based on Boolean models
Background: Many biological networks such as protein-protein interaction networks, signaling networks, and metabolic networks have topological characteristics of a scale-free degr...
Yung-Keun Kwon, Kwang-Hyun Cho
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 5 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh