SOFSEM 2010 - PDF Preprint Papers

SOFSEM 2010 Seminar/Conference on Current Trends in Theory and Practice of Informatics

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SOFSEM-2010 Paper

click to vote

SOFSEM
2010
Springer

323views Theoretical Computer Science» more SOFSEM 2010»

Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem

14 years 1 months ago

Download www.sofsem.cz

Simone Faro, Elisa Pappalardo

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	323	Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem	claim
2	259	A Complete Symbolic Bisimulation for Full Applied Pi Calculus	claim
3	203	On a Labeled Vehicle Routing Problem	claim
4	199	Regret Minimization and Job Scheduling	claim
5	193	Dynamic Edit Distance Table under a General Weighted Cost Function	claim
6	185	OTwig: An Optimised Twig Pattern Matching Approach for XML Databases	claim
7	184	Approximate Structural Consistency	claim
8	179	An Amortized Search Tree Analysis for k-Leaf Spanning Tree	claim
9	175	Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs	claim
10	169	Model-Driven Software Product Line Testing: An Integrated Approach	claim
11	167	Continuous Processing of Preference Queries in Data Streams	claim
12	166	Finding and Certifying Loops	claim
13	163	Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph	claim
14	157	A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks	claim
15	157	A Kernel for Convex Recoloring of Weighted Forests	claim
16	153	Approximability of Edge Matching Puzzles	claim
17	152	Flavors of KWQL, a Keyword Query Language for a Semantic Wiki	claim
18	152	Practically Applicable Formal Methods	claim
19	146	Accelerating Smart Play-Out	claim
20	144	Homophily of Neighborhood in Graph Relational Classifier	claim
21	142	Parallel Randomized Load Balancing: A Lower Bound for a More General Model	claim
22	140	Maintaining XML Data Integrity in Programs	claim
23	138	Lessons in Software Evolution Learned by Listening to Smalltalk	claim
24	137	Comparison of Scoring and Order Approach in Description Logic EL(D)	claim
25	134	The Web of Things: Extending the Web into the Real World	claim
26	132	Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays	claim
27	131	A Social Vision of Knowledge Representation and Reasoning	claim
28	130	Smooth Optimal Decision Strategies for Static Team Optimization Problems and Their Approximations	claim
29	127	Source Code Rejuvenation Is Not Refactoring	claim
30	127	Improved Matrix Interpretation	claim
31	125	Unilateral Orientation of Mixed Graphs	claim
32	125	Student Groups Modeling by Integrating Cluster Representation and Association Rules Mining	claim
33	125	CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions	claim
34	124	Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup	claim
35	124	Clock Synchronization: Open Problems in Theory and Practice	claim
36	122	Mixing Coverability and Reachability to Analyze VASS with One Zero-Test	claim
37	121	Web Science: The Digital-Heritage Case	claim
38	118	Picture Recognizability with Automata Based on Wang Tiles	claim
39	118	Fast Arc-Annotated Subsequence Matching in Linear Space	claim
40	116	On the Complexity of the Highway Pricing Problem	claim
41	115	Taming the Complexity of Inductive Logic Programming	claim
42	113	Vertex Ranking with Capacity	claim
43	113	How to Complete an Interactive Configuration Process?	claim
44	112	Research Issues in the Automated Testing of Ajax Applications	claim
45	112	New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes	claim
46	111	Forcing Monotonicity in Parameterized Verification: From Multisets to Words	claim
47	108	Fast and Compact Prefix Codes	claim
48	107	Linear Complementarity Algorithms for Infinite Games	claim
49	106	Optimum Broadcasting in Complete Weighted-Vertex Graphs	claim
50	105	Symbolic OBDD-Based Reachability Analysis Needs Exponential Space	claim
51	104	On Contracting Graphs to Fixed Pattern Graphs	claim
52	99	A Rule Format for Unit Elements	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers