Sciweavers

1204 search results - page 115 / 241
» Hybrid Probabilistic Programs
Sort
View
137
Voted
EMNLP
2006
15 years 2 months ago
Incremental Integer Linear Programming for Non-projective Dependency Parsing
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...
Sebastian Riedel, James Clarke
74
Voted
IPPS
2007
IEEE
15 years 7 months ago
Cost-Driven Hybrid Configuration Prefetching for Partial Reconfigurable Coprocessor
Reconfigurable computing systems have developed the capability of changing the configuration of the reconfigurable coprocessor multiple times during the course of a program. Howev...
Ying Chen, Simon Y. Chen
MSN
2007
Springer
125views Sensor Networks» more  MSN 2007»
15 years 6 months ago
Ensuring Area Coverage in Hybrid Wireless Sensor Networks
Success of Wireless Sensor Networks largely depends whether the deployed network can provide desired coverage with acceptable network lifetime. This paper proposes a distributed pr...
Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha
99
Voted
CNSR
2006
IEEE
136views Communications» more  CNSR 2006»
15 years 6 months ago
Combining Petri Nets and ns-2: A Hybrid Method for Analysis and Simulation
Network protocol performance and evaluation study is often carried out using a couple of widely used simulation toolkits, such as ns-2 and OPNET. These toolkits usually contain ma...
Qiang Ye, Mike H. MacGregor
CP
2004
Springer
15 years 6 months ago
Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
Andrew Sadler, Carmen Gervet