Sciweavers

13180 search results - page 2390 / 2636
» Network Models
Sort
View
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 7 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
WCE
2007
15 years 5 months ago
A Patch-by-Patch Shape Matching Procedure for Rigid Body Docking
Abstract—Docking simulates molecular interactions. Protein - protein docking, owing to the sizes of molecules, is a very challenging problem. As the number of degrees of freedom ...
Vipin K. Tripathi
TEC
2008
139views more  TEC 2008»
15 years 3 months ago
Genetic Programming Approaches for Solving Elliptic Partial Differential Equations
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
Andras Sobester, Prasanth B. Nair, Andy J. Keane
CDC
2010
IEEE
106views Control Systems» more  CDC 2010»
14 years 11 months ago
Observational learning in an uncertain world
We study a model of observational learning in social networks in the presence of uncertainty about agents' type distributions. Each individual receives a private noisy signal ...
Daron Acemoglu, Munther A. Dahleh, Asuman E. Ozdag...
161
Voted
ACL
2012
13 years 6 months ago
Learning to "Read Between the Lines" using Bayesian Logic Programs
Most information extraction (IE) systems identify facts that are explicitly stated in text. However, in natural language, some facts are implicit, and identifying them requires â€...
Sindhu Raghavan, Raymond J. Mooney, Hyeonseo Ku
« Prev « First page 2390 / 2636 Last » Next »