Sciweavers

1197 search results - page 205 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
RSP
1999
IEEE
128views Control Systems» more  RSP 1999»
14 years 9 days ago
3-D Floorplanning: Simulated Annealing and Greedy Placement Methods for Reconfigurable Computing Systems
The advances in the programmable hardware has lead to new architectures where the hardware can be dynamically adapted to the application to gain better performance. There are stil...
Kia Bazargan, Ryan Kastner, Majid Sarrafzadeh
DSRT
2003
IEEE
14 years 1 months ago
Interest Management in Agent-Based Distributed Simulations
Distributed simulation enables participants situated in different geographical locations to share a common virtual world, which is called a Distributed Virtual Environment (DVE). ...
Lihua Wang, Stephen John Turner, Fang Wang
PVLDB
2008
136views more  PVLDB 2008»
13 years 7 months ago
Keyword query cleaning
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
Ken Q. Pu, Xiaohui Yu
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 8 months 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...
LCTRTS
2010
Springer
14 years 2 months ago
Sampling-based program execution monitoring
For its high overall cost during product development, program debugging is an important aspect of system development. Debugging is a hard and complex activity, especially in time-...
Sebastian Fischmeister, Yanmeng Ba