Sciweavers

1480 search results - page 253 / 296
» Ants can solve constraint satisfaction problems
Sort
View
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
14 years 11 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002
NPC
2004
Springer
14 years 4 months ago
Lookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
Xuezheng Liu, Guangwen Yang, Jinfeng Hu, Ming Chen...
DATE
2002
IEEE
123views Hardware» more  DATE 2002»
14 years 4 months ago
False Path Elimination in Quasi-Static Scheduling
We have developed a technique to compute a Quasi Static Schedule of a concurrent specification for the software partition of an embedded system. Previous work did not take into a...
G. Arrigoni, L. Duchini, Claudio Passerone, Lucian...
VLSID
1999
IEEE
100views VLSI» more  VLSID 1999»
14 years 3 months ago
Satisfiability-Based Detailed FPGA Routing
In this paper we address the problem of detailed FPGA routing using Boolean formulation methods. In the context of FPGA routing where routing resources are fixed, Boolean formulat...
Gi-Joon Nam, Karem A. Sakallah, Rob A. Rutenbar
ICSE
1999
IEEE-ACM
14 years 3 months ago
Exploiting ADLs to Specify Architectural Styles Induced by Middleware Infrastructures
Architecture Definition Languages (ADLs) enable the formalization of the architecture of software systems and the execution of preliminary analyses on them. These analyses aim at...
Elisabetta Di Nitto, David S. Rosenblum