Sciweavers

661 search results - page 110 / 133
» Combining Information using Hard Constraints
Sort
View
113
Voted
IFL
2004
Springer
122views Formal Methods» more  IFL 2004»
15 years 5 months ago
Source-Based Trace Exploration
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...
Olaf Chitil
99
Voted
ATAL
2006
Springer
15 years 4 months ago
Gradient field-based task assignment in an AGV transportation system
Assigning tasks to agents is complex, especially in highly dynamic environments. Typical protocol-based approaches for task assignment such as Contract Net have proven their value...
Danny Weyns, Nelis Boucké, Tom Holvoet
FGR
2008
IEEE
264views Biometrics» more  FGR 2008»
15 years 2 months ago
Large scale learning and recognition of faces in web videos
The phenomenal growth of video on the web and the increasing sparseness of meta information associated with it forces us to look for signals from the video content for search/info...
Ming Zhao 0003, Jay Yagnik, Hartwig Adam, David Ba...
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 15 days ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
MOBIHOC
2004
ACM
15 years 12 months ago
Rate allocation in wireless sensor networks with network lifetime requirement
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Sin...
Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali